Decidability and Complexity in Automatic Monoids

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30550-7_26
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Type Structure Complexity and Decidability

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Mortality of Iterated Piecewise Affine Functions Over the Integers: Decidability and Complexity

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2015English

Congruences on Free Monoids and Submonoids of Polycyclic Monoids

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1993English

F-Monoids

Communications in Algebra
Number TheoryAlgebra
2007English

Decidability and Syntactic Control of Interference

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

Embedding Simple Commutative Monoids Into Simple Refinement Monoids

Semigroup Forum
Number TheoryAlgebra
1998English

Computation in Linear Algebraic Monoids

Journal of Applied & Computational Mathematics
2014English

Representable Monoids

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1978English

Factorization Theory in Commutative Monoids

Semigroup Forum
Number TheoryAlgebra
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy