Finite-type-Dyck shift spaces
Formal Languages and Automata Theory
2013-11-19 v1
Abstract
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck shifts into a sequence of Dyck splittings and amalgamations.
Keywords
Cite
@article{arxiv.1311.4223,
title = {Finite-type-Dyck shift spaces},
author = {Marie-Pierre Béal and Michel Blockelet and Cǎtǎlin Dima},
journal= {arXiv preprint arXiv:1311.4223},
year = {2013}
}