Decidability of Irreducible Tree Shifts of Finite Type

Journal of Statistical Physics - United States
doi 10.1007/s10955-019-02407-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Computing Irreducible Representations of Finite Groups

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1990English

Irreducible Matrix Representations of Finite Semigroups

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1969English

On Global Dimensions of Tree Type Finite Dimensional Algebras

Canadian Mathematical Bulletin
Mathematics
2014English

Decidability of Conversion for Type Theory in Type Theory

Proceedings of the ACM on Programming Languages
2018English

Irreducible Finite-Dimensional Representations of Equivariant Map Algebras

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
2012English

Finite Irreducible Linear 2-Groups of Degree 4

Bulletin of the Australian Mathematical Society
Mathematics
1993English

Type Structure Complexity and Decidability

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Finding Irreducible Polynomials Over Finite Fields

1986English

Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy