Enumeration and Decidable Properties of Automatic Sequences
From MaRDI portal
Publication:5199962
DOI10.1007/978-3-642-22321-1_15zbMath1221.68122OpenAlexW1854985511MaRDI QIDQ5199962
Émilie Charlier, Narad Rampersad, Jeffrey O. Shallit
Publication date: 29 July 2011
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_15
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Automata sequences (11B85)
Related Items (5)
On automatic infinite permutations ⋮ Automatic Theorem-Proving in Combinatorics on Words ⋮ Abelian Complexity and Synchronization ⋮ A note on the Lie complexity and beyond ⋮ On the Number of Unbordered Factors
This page was built for publication: Enumeration and Decidable Properties of Automatic Sequences
