Cellular automata, ωω-regular sets, and sofic systems
- 29 July 1991
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 32 (2), 85-101
- https://doi.org/10.1016/0166-218x(91)90094-d
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Limit Sets of Cellular AutomataSIAM Journal on Computing, 1989
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- On the complementation of Büchi automataTheoretical Computer Science, 1986
- Ensembles Reconnaissables de Mots BiinfinisCanadian Journal of Mathematics, 1986
- Ensembles reconnaissables de mots biinfinisPublished by Association for Computing Machinery (ACM) ,1982
- Equivalence problems for mappings on infinite stringsInformation and Control, 1981
- Adherences of languagesJournal of Computer and System Sciences, 1980
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Subshifts of finite type and sofic systemsMonatshefte für Mathematik, 1973
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966