A series of slowly synchronizing automata with a zero state over a small alphabet

Authors:
P. V. Martugin
Affiliations:
Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia
Venue:
Information and Computation
Year:
2008

Citing 5
Cited 3

Reset sequences for monotonic automata

SIAM Journal on Computing
Synchronizing finite automata on Eulerian digraphs

Theoretical Computer Science - Mathematical foundations of computer science
Synchronizing monotonic automata

Theoretical Computer Science - Developments in language theory
Synchronizing generalized monotonic automata

Theoretical Computer Science - Insightful theory
The mortality threshold for partially monotonic automata

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Complexity of problems concerning reset words for some partial cases of automata

Acta Cybernetica
COMPAS: a computing package for synchronization

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	0.00

Visualization

Abstract

For each integer n=8, we construct an n-state synchronizing automation with a zero state and only 2 input letters such that the minimum length of reset words for the automaton is n^2+6n-164.