Sofic shifts with synchronizing presentations

Theoretical Computer Science

Volumn 158, Issue 1-2, 1996, Pages 81-115

  Jonoska, Nataša ^a  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; GRAPH THEORY; SET THEORY; SYNCHRONIZATION; TOPOLOGY;

BI-INFINITE SEQUENCES; FACTOR LANGUAGE; SOFIC SHIFTS; SYNCHRONIZING PRESENTATION;

COMPUTATIONAL METHODS;

EID: 0030148233     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00058-8     Document Type: Article

References (19)

1. D. Beauquier, Minimal automaton for factorial transitive and rational languages, Theoret. Comput. Sci. 67 (1989) 65-75.
2. F. Blanchard and G. Hansel, Languages and Subshifts, Automata on Infinite Words, Lecture Notes in Computer Science, Vol. 192 (Springer, Berlin, 1984) 138-146.
3. M. Boyle, B. Kitchens and B. Marcus, A note on minimal covers for sofic systems, Proc. AMS 95 (1985) 403-411.
4. D. Fiebig and U.R. Fiebig, Covers for coded systems, Symbolic Dynamics and its Applications (Contemporary Mathematics, Vol. 135) (1992) 139-180.
5. R. Fischer, Sofic systems and graphs, Monatsh. Math. 80 (1975) 179-186.
6. G.A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Math. Systems Theory 3 (1969) 320-375.
7. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
8. N. Jonoska, Deciding equality of irreducible sofic shifts, manuscript.
9. N. Jonoska and B. Marcus, Minimal presentations for irreducible sofic shifts, IEEE Trans. Inform. Theory. 40 (1994) 1818-1825.
10. W. Krieger, On sofic systems I, Israel J. Math. 48 (1984) 305-330.
11. G. Lallement, Semigroups and Combinatorial Applications (Wiley/Interscience, New York, 1979).
12. B. Marcus and R. Roth, Bounds on the number of states in encoders graphs for input-constrained channels, IEEE Trans. Inform. Theory IT-37 (1991) 742-758.
13. D. Perrin, Synchronizing automata, in: R. Capocelli, A. De Santis and U. Vaccaro, eds., Sequences II - Methods in Communication Security and Computer Science (Springer, New York, 1993) 470-477.
14. D. Perrin and M.P. Schützenberger, Synchronizing prefix codes and automata and the road coloring problem, Symbolic Dynamics and its Applications (Contemporary Mathematics, Vol. 135) (1992) 295-318.
15. J.E. Pin, Varieties of Formal Languages (North Oxford, London; Plenum, New York, 1986).
16. M.P. Schützenberger, Sur Certaines Opérations de Fermeture Dans les Language Rationnels, RAIRO Inform. Theory 1 (1974) 55-61.
17. B. Weiss, Subshifts of finite type and sofic systems, Monatsh. Math. 77 (1973) 462-474.
18. J. Willems, Models for dynamics, Dynamics Reported 2 (1989) 171-269.
19. S. Wolfram, ed., Theory and Applications of Cellular Automata (World Scientific, Singapore, 1986).