Careful synchronization of partial deterministic finite automata
From MaRDI portal
Publication:2170286
DOI10.1007/s00236-022-00433-1OpenAlexW4286698100MaRDI QIDQ2170286
Hanan Shabana, Mikhail V. Volkov
Publication date: 30 August 2022
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01045
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive digraphs with large exponents and slowly synchronizing automata
- Exact synchronization for finite-state sources
- Asymptotic synchronization for finite-state sources
- A lower bound for the length of the shortest carefully synchronizing words
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Polynomial complete problems in automata theory
- Černý's conjecture and the road colouring problem
- Existence of constants in regular splicing languages
- Computing the shortest reset words of synchronizing automata
- Model-based testing of reactive systems. Advanced lectures.
- Using SAT solvers for synchronization issues in non-deterministic automata
- On the Probability of Being Synchronizable
- Synchronization of Automata with One Undefined or Ambiguous Transition
- On Two Algorithmic Problems about Synchronizing Automata
- Synchronizing Automata and the Černý Conjecture
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
- Asymptotic estimate of the length of a diagnostic word for a finite automaton
- Synchronizing non-deterministic finite automata
- Algebraic Theory of Automata and Languages
- Careful Synchronization of Partial Automata with Restricted Alphabets
- Вычисление распределений характеристик чисел компонент и циклических точек случайного отображения
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
- Experimental Study of the Shortest Reset Word of Random Automata
- The Cerny Conjecture Holds with High Probability
- Theory and Applications of Satisfiability Testing
- Lower Bounds for Synchronizing Word Lengths in Partial Automata
- Probability Distributions Related to Random Mappings
This page was built for publication: Careful synchronization of partial deterministic finite automata
