Decidability of Conjugacy of Tree-Shifts of Finite Type

DOI10.1007/978-3-642-02927-1_13zbMath1248.68283OpenAlexW1790397476MaRDI QIDQ3638030

Marie-Pierre Béal, Nathalie Aubrun

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (5)

Tree shift topological entropy ⋮ Entropy on regular trees ⋮ Sofic tree-shifts ⋮ Tree-shifts of finite type ⋮ A language hierarchy and kitchens-type theorem for self-similar groups

This page was built for publication: Decidability of Conjugacy of Tree-Shifts of Finite Type