Synchronization of finite automata
From MaRDI portal
Complexity of computation (including implicit computational complexity) (03D15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Semigroups in automata theory, linguistics, etc. (20M35) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)
Recommendations
- scientific article; zbMATH DE number 826076
- Synchronization and stability of finite automata
- Synchronization of Regular Automata
- Synchronizing non-deterministic finite automata
- scientific article; zbMATH DE number 1953272
- SYNCHRONIZATION OF TWO INTERACTING FINITE AUTOMATA
- Synchronised automata
- Finitely Generated Synchronizing Automata
- Synchronization of Pushdown Automata
- Synchronization of Parikh automata
Cited in
(29)- Synchronizing finite automata with short reset words
- On synchronizing unambiguous automata
- Deterministic synchronization of automata with bounded delay
- Synchronizing generalized monotonic automata
- Introducing synchrony in fuzzy automata
- Experiments with Synchronizing Automata
- Subset synchronization and careful synchronization of binary finite automata
- Synchronizing Automata with Extremal Properties
- Experiments on Synchronizing Automata
- Synchronizing Automata Preserving a Chain of Partial Orders
- Synchronizing Data Words for Register Automata
- scientific article; zbMATH DE number 6861928 (Why is no real title available?)
- scientific article; zbMATH DE number 1834666 (Why is no real title available?)
- SYNCHRONIZATION OF TWO INTERACTING FINITE AUTOMATA
- A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Reset sink complexity of regular ideals
- Subset mapping problems in solvable automata
- Don's conjecture for binary completely reachable automata: an approach and its limitations
- Bollobás set pair inequalities for compositions
- Around Don's conjecture for binary completely reachable automata
- A cornering strategy for synchronizing a DFA
- Monoids of upper triangular matrices over the Boolean semiring
- A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
- The hereditariness problem for the Černý conjecture
- Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices
- The complexity of reachability problems in strongly connected finite automata
- Synchronization of strongly connected partial DFAs and prefix codes
This page was built for publication: Synchronization of finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178262)
