Careful synchronization of partial deterministic finite automata

Cites Work

Theory and Applications of Satisfiability Testing
Title not available (Why is that?)
Synchronizing Automata and the Černý Conjecture
Model-based testing of reactive systems. Advanced lectures.
Title not available (Why is that?)
Title not available (Why is that?)
Polynomial complete problems in automata theory
Title not available (Why is that?)
Probability Distributions Related to Random Mappings
Primitive digraphs with large exponents and slowly synchronizing automata
Experimental Study of the Shortest Reset Word of Random Automata
Algebraic Theory of Automata and Languages
On the Probability of Being Synchronizable
SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
Title not available (Why is that?)
Existence of constants in regular splicing languages
On Two Algorithmic Problems about Synchronizing Automata
Exact synchronization for finite-state sources
Asymptotic synchronization for finite-state sources
Synchronization of Automata with One Undefined or Ambiguous Transition
Careful Synchronization of Partial Automata with Restricted Alphabets
Title not available (Why is that?)
Lower Bounds for Synchronizing Word Lengths in Partial Automata
A lower bound for the length of the shortest carefully synchronizing words
Title not available (Why is that?)
Computing the shortest reset words of synchronizing automata
Synchronizing non-deterministic finite automata
Asymptotic estimate of the length of a diagnostic word for a finite automaton
Вычисление распределений характеристик чисел компонент и циклических точек случайного отображения
Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
Černý's conjecture and the road colouring problem
The Cerny Conjecture Holds with High Probability
Using SAT solvers for synchronization issues in non-deterministic automata
D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA

Cited In (6)

Synchronizing Automata Preserving a Chain of Partial Orders
Subset synchronization and careful synchronization of binary finite automata
Title not available (Why is that?)
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

Uses Software

MiniSat

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)