On syntactic congruences for ω-languages
- 1 August 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 183 (1) , 93-112
- https://doi.org/10.1016/s0304-3975(96)00312-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Characterizations of rational ω-languages by means of right congruencesTheoretical Computer Science, 1995
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDSInternational Journal of Algebra and Computation, 1993
- X-automata on ω-wordsTheoretical Computer Science, 1993
- 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?-Languages whose syntactic monoid is trivialInternational Journal of Parallel Programming, 1983
- On ω-regular setsInformation and Control, 1979