论文信息 - Finite procedures for sofic systems

Finite procedures for sofic systems

A sofic system is a symbolic flow defined by a finite semigroup. We exhibit finite procedures, involving only the defining semigroup, for answering cetain questions about a sofic system and for constructing certain subshifts of finite type associated with a sofic system.

Michael E. Paul | Ethan M. Conen

[1] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[2] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .

[3] H. Wielandt. Unzerlegbare, nicht negative Matrizen , 1950 .

[4] W. Parry. Intrinsic Markov chains , 1964 .

[5] Anthony Manning,et al. Axiom A Diffeomorphisms have Rational Zeta Functions , 1971 .

[6] B. Weiss. Subshifts of finite type and sofic systems , 1973 .

[7] Michael E. Paul,et al. Sofic systems , 1975 .

[8] Roland Fischer. Sofic systems and graphs , 1975 .