Preset Distinguishing Sequences and Diameter of Transformation Semigroups

DOI10.1007/978-3-319-15579-1_27zbMath1451.68159arXiv1412.0034OpenAlexW1867631009MaRDI QIDQ2799186

Pavel A. Panteleev

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.0034

zbMATH Keywords

automatadiametertransformation semigroupfinite-state machinepreset-distinguishing sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

On the Interplay Between Černý and Babai’s Conjectures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The relation between preset distinguishing sequences and synchronizing sequences
• A lower bound for the length of the shortest carefully synchronizing words
• Improved upper bounds on synchronizing nondeterministic automata
• Composition sequences for functions over a finite domain.
• On the diameter of Eulerian orientations of graphs
• Asymptotic estimate of the length of a diagnostic word for a finite automaton
• State-identification experiments in finite automata
• Properties of Linear Machines
• Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines

This page was built for publication: Preset Distinguishing Sequences and Diameter of Transformation Semigroups