On the Quantized Dynamics of Factorial Languages
From MaRDI portal
Abstract: We study local piecewise conjugacy of the quantized dynamics arising from factorial languages. We show that it induces a bijection between allowable words of same length and thus it preserves entropy. In the case of sofic factorial languages we prove that local piecewise conjugacy translates to unlabeled graph isomorphism of the follower set graphs. Moreover it induces an unlabeled graph isomorphism between the Fischer covers of irreducible subshifts. We verify that local piecewise conjugacy does not preserve finite type nor irreducibility; but it preserves soficity. Moreover it implies identification (up to a permutation) for factorial languages of type if, and only if, the follower set function is one-to-one on the symbol set.
Recommendations
- Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
- On the computation of quotients and factors of regular languages
- scientific article; zbMATH DE number 15264
- Quantitative Languages Defined by Functional Automata
- Quantitative languages defined by functional automata
- scientific article; zbMATH DE number 2162119
- FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
- A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
- Canonical decomposition of catenation of factorial languages
- Factorial Languages of Low Combinatorial Complexity
Cited in
(5)- On intermediate factorial languages
- Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
- Operator algebras for higher rank analysis and their application to factorial languages
- Operator algebras of monomial ideals in noncommuting variables
- Quantitative Languages Defined by Functional Automata
This page was built for publication: On the Quantized Dynamics of Factorial Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4684197)