Almost periodicity, finite automata mappings, and related effectiveness issues

DOI10.3103/S1066369X1001007XzbMath1184.68329MaRDI QIDQ845086

Yu. L. Pritykin

Publication date: 5 February 2010

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

zbMATH Keywords

effectivenessfinite automataalmost periodic sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Automata transformations of prefix decidable and decidable by Buchi superwords ⋮ Uniformly recurrent sequences and minimal Cantor omega-limit sets

Cites Work

• Unnamed Item
• Unnamed Item
• On the valuedness of finite transducers
• Almost periodic sequences.
• Finite-automaton transformations of strictly almost-periodic sequences
• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
• Generalized Morse sequences
• Symbolic Dynamics
• Symbolic Dynamics II. Sturmian Trajectories

This page was built for publication: Almost periodicity, finite automata mappings, and related effectiveness issues