On the bound of the synchronization delay of a local automaton

DOI10.1016/S0304-3975(98)80011-XzbMath0917.68149OpenAlexW4298417343MaRDI QIDQ1275089

Marie-Pierre Béal, Jean Senellart

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)80011-x

zbMATH Keywords

synchronizationautomatonlocal automatonlocally testable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Identification of all trinucleotide circular codes ⋮ A tight linear bound on the synchronization delay of bijective automata ⋮ Maximal dinucleotide and trinucleotide circular codes ⋮ Dinucleotide circular codes ⋮ A classification of 20-trinucleotide circular codes ⋮ A permuted set of a trinucleotide circular code coding the 20 amino acids in variant nuclear codes ⋮ Strong trinucleotide circular codes ⋮ Optimal estimation on the order of local testability of finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Computing the Order of a Locally Testable Automaton
• An Introduction to Symbolic Dynamics and Coding
• The Theory of Definite Automata

This page was built for publication: On the bound of the synchronization delay of a local automaton