Automaton transformations and monadic theories of infinite sequences

DOI10.3103/S1066369X11080123zbMATH Open1233.68152MaRDI QIDQ647900FDOQ647900

Authors: N. N. Korneeva 

Publication date: 21 November 2011

Published in: Russian Mathematics (Search for Journal in Brave)

Recommendations

• Degrees of asynchronously automaton transformations
• Automata transformations of prefix decidable and decidable by Buchi superwords
• Semigroups arising from asynchronous automata.
• scientific article; zbMATH DE number 3904569
• Degrees of Infinite Words, Polynomials and Atoms

zbMATH Keywords

complete sequencesautomaton transformationsmonadic theories of infinite sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Sequences close to periodic
• Degrees of asynchronously automaton transformations
• Complete degrees of finite-state transformability
• An isomorphism of complete degrees of finite-state transformability

Cited In (5)

• Implementation and Application of Automata
• Complexity Analysis: Transformation Monoids of Finite Automata
• Automata transformations of prefix decidable and decidable by Buchi superwords
• Title not available (Why is that?)
• Morphisms on infinite alphabets, countable states automata and regular sequences

This page was built for publication: Automaton transformations and monadic theories of infinite sequences

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