Abstract
We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the shifts. © Springer-Verlag 2004.
Author supplied keywords
Cite
CITATION STYLE
APA
Béai, M. P., Fiorenzi, P., & Perrin, D. (2004). A hierarchy of irreducible sofie shifts. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3153, 611–622. https://doi.org/10.1007/978-3-540-28629-5_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free