Careful synchronization of partial deterministic finite automata
From MaRDI portal
Recommendations
- Careful synchronization of partial automata with restricted alphabets
- A lower bound for the length of the shortest carefully synchronizing words
- Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
- Using SAT solvers for synchronization issues in non-deterministic automata
- \(D_2\)-synchronization in nondeterministic automata
Cites work
- scientific article; zbMATH DE number 6861928 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- A lower bound for the length of the shortest carefully synchronizing words
- Algebraic Theory of Automata and Languages
- Asymptotic estimate of the length of a diagnostic word for a finite automaton
- Asymptotic synchronization for finite-state sources
- Careful synchronization of partial automata with restricted alphabets
- Codes and automata.
- Computation of distributions of the numbers of components and cyclic points for random mappings
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Computing the shortest reset words of synchronizing automata
- Exact synchronization for finite-state sources
- Existence of constants in regular splicing languages
- Experimental study of the shortest reset word of random automata
- Handbook of knowledge representation.
- Lower bounds for synchronizing word lengths in partial automata
- Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
- Model-based testing of reactive systems. Advanced lectures.
- On the probability of being synchronizable
- On two algorithmic problems about synchronizing automata (short paper)
- Polynomial complete problems in automata theory
- Primitive digraphs with large exponents and slowly synchronizing automata
- Probability Distributions Related to Random Mappings
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
- Synchronization of automata with one undefined or ambiguous transition
- Synchronizing Automata and the Černý Conjecture
- Synchronizing non-deterministic finite automata
- The Cerny Conjecture Holds with High Probability
- Theory and Applications of Satisfiability Testing
- Using SAT solvers for synchronization issues in non-deterministic automata
- \(D_2\)-synchronization in nondeterministic automata
- Černý's conjecture and the road colouring problem
Cited in
(6)- Synchronizing Automata Preserving a Chain of Partial Orders
- Subset synchronization and careful synchronization of binary finite automata
- scientific article; zbMATH DE number 6665216 (Why is no real title available?)
- Deterministic synchronization of automata with bounded delay
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA
This page was built for publication: Careful synchronization of partial deterministic finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170286)
