Degrees of asynchronously automaton transformations

DOI10.3103/S1066369X11030042MaRDI QIDQ647840zbMATHFDO

Authors N. N. Korneeva

Publication date 21 November 2011

Published in Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

partial ordertransducersinfinite wordsMealy automatacoverings of degreesdegrees of asynchronously automaton transformationsfinite asynchronous automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Some Algebraic Properties of Machine Poset of Infinite Words
• Semigroups arising from asynchronous automata.
• scientific article; zbMATH DE number 4078815
• Finite-state automata on infinite inputs
• Transducer degrees: atoms, infima and suprema
• scientific article; zbMATH DE number 3976377
• scientific article; zbMATH DE number 1948506
• Automata on infinite words. Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
• Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords

Cited in

(6)

• Automaton transformations and monadic theories of infinite sequences
• scientific article; zbMATH DE number 3904569 (Why is no real title available?)
• The degree of squares is an atom
• Degrees of infinite words, polynomials and atoms
• Automata transformations of prefix decidable and decidable by Buchi superwords
• scientific article; zbMATH DE number 4078815 (Why is no real title available?)

This page was built for publication: Degrees of asynchronously automaton transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647840)