Extremal synchronizing circular automata

DOI10.1016/J.IC.2021.104817MaRDI QIDQ2051843zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 25 November 2021

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2021.104817

zbMATH Keywords

augmented statecharacteristic groupdefected stateskipped stateuncoupling letter

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Synchronizing Automata with Extremal Properties
• The Černý conjecture and 1-contracting automata
• The Černý conjecture for one-cluster automata with prime length cycle
• Synchronised automata
• scientific article; zbMATH DE number 7152087

Cites work

• A counter example to a conjecture concerning synchronizing words in finite automata
• An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
• Attainable values of reset thresholds
• DFAs and PFAs with long shortest synchronizing word length
• Experiments with Synchronizing Automata
• Finding DFAs with maximal shortest synchronizing word length
• scientific article; zbMATH DE number 3887879 (Why is no real title available?)
• scientific article; zbMATH DE number 53545 (Why is no real title available?)
• scientific article; zbMATH DE number 5593050 (Why is no real title available?)
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• scientific article; zbMATH DE number 3354928 (Why is no real title available?)
• Lower bounds for synchronizing word lengths in partial automata
• Primitive digraphs with large exponents and slowly synchronizing automata
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• Reset Sequences for Monotonic Automata
• Slowly synchronizing automata with fixed alphabet size
• Synchronizing Automata and the Černý Conjecture
• Synchronizing automata preserving a chain of partial orders
• Synchronizing Automata with Extremal Properties
• Synchronizing finite automata on Eulerian digraphs.
• Synchronizing generalized monotonic automata
• Synchronizing monotonic automata
• The Černý conjecture for aperiodic automata
• The Černý conjecture for one-cluster automata with prime length cycle

Cited in

(2)

• Synchronizing Automata with Extremal Properties
• Binary completely reachable automata

This page was built for publication: Extremal synchronizing circular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051843)