Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts

DOI10.1007/978-3-319-21500-6_13zbMath1434.68229OpenAlexW1130303699MaRDI QIDQ3451099

Pavel Heller, Marie-Pierre Béal

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21500-6_13

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• Tree-shifts of finite type
• Symbolic dynamics
• Zeta functions and topological entropy of the Markov-Dyck shifts
• Sofic-Dyck Shifts
• Adding nesting structure to words
• Visibly pushdown languages
• On the uniqueness of the equilibrium state
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts