Automata transformations of prefix decidable and decidable by Buchi superwords

DOI10.3103/S1066369X16070070zbMath1420.68108MaRDI QIDQ309440

N. N. Korneeva

Publication date: 7 September 2016

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

zbMATH Keywords

automata transformationBüchi superwordmonadic theoryprefix decidability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The structure of degrees of finite-automaton transformations of prefix decidable superwords

Cites Work

• Degrees of asynchronously automaton transformations
• Automaton transformations and monadic theories of infinite sequences
• Almost periodicity, finite automata mappings, and related effectiveness issues
• Iteration of maps by an automaton
• Almost periodic sequences.
• Finite-automaton transformations of strictly almost-periodic sequences
• Sequences close to periodic
• Uniform tag sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automata transformations of prefix decidable and decidable by Buchi superwords