Unambiguous Büchi automata
Open Access
- 28 January 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 297 (1-3) , 37-81
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- Codeterministic automata on infinite wordsInformation Processing Letters, 1985
- Iteration of expansions — unambiguous semigroupsJournal of Pure and Applied Algebra, 1984
- 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
- On the complexity of finite semigroupsJournal of Pure and Applied Algebra, 1974
- Decision problems forω-automataTheory of Computing Systems, 1969
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Infinite sequences and finite machines1963