Recent results on automata and infinite words
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 134-148
- https://doi.org/10.1007/bfb0030294
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985
- Rational Ω-languages are non-ambiguousTheoretical Computer Science, 1983
- Determinancy of sinking automata on infinite trees and inequalities between various Rabin's pair indicesInformation Processing Letters, 1982
- Ensembles reconnaissables de mots biinfinisPublished by Association for Computing Machinery (ACM) ,1982
- A combinatorial approach to the theory of ω-automataInformation and Control, 1981
- Star-free regular sets of ω-sequencesInformation and Control, 1979
- Decision problems forω-automataTheory of Computing Systems, 1969
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966