Degrees of asynchronously automaton transformations
From MaRDI portal
Publication:647840
DOI10.3103/S1066369X11030042zbMath1247.03080MaRDI QIDQ647840
Publication date: 21 November 2011
Published in: Russian Mathematics (Search for Journal in Brave)
partial order; infinite words; transducers; Mealy automata; coverings of degrees; degrees of asynchronously automaton transformations; finite asynchronous automata
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Automata transformations of prefix decidable and decidable by Buchi superwords, Automaton transformations and monadic theories of infinite sequences
Cites Work