Characterizations of rational ω-languages by means of right congruences
- 10 July 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 143 (1) , 1-21
- https://doi.org/10.1016/0304-3975(95)80022-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORYInternational Journal of Algebra and Computation, 1991
- Saturating right congruencesRAIRO - Theoretical Informatics and Applications, 1990
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985
- Finite-state ω-languagesJournal of Computer and System Sciences, 1983
- On ω-regular setsInformation and Control, 1979
- Decision problems forω-automataTheory of Computing Systems, 1969
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966