Constrained synchronization and subset synchronization problems for weakly acyclic automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 7376042 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- Complexity of universality and related problems for partially ordered NFAs
- Computational complexity of synchronization under regular commutative constraints
- Languages of R-trivial monoids
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- Parallel algorithms for solvable permutation groups
- Parallel recognition of series-parallel graphs
- Polynomial complete problems in automata theory
- Preimage problems for deterministic finite automata
- Principles and Practice of Constraint Programming – CP 2004
- Reset Sequences for Monotonic Automata
- Semicomputable points in Euclidean spaces
- Series parallel digraphs with loops
- Shortest path under rational constraint
- Subset synchronization and careful synchronization of binary finite automata
- Synchronization of automata with one undefined or ambiguous transition
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata of bounded rank
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Synchronizing words and monoid factorization: a parameterized perspective
- The complexity of intersecting finite automata having few final states
- The complexity of theorem-proving procedures
- The existential theory of equations with rational constraints in free groups is PSPACE-complete
Cited in
(8)- Computational complexity of synchronization under sparse regular constraints
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- scientific article; zbMATH DE number 6665216 (Why is no real title available?)
- Constrained synchronization and commutativity
- Subset synchronization and careful synchronization of binary finite automata
- Semicomputable points in Euclidean spaces
- Synchronizing words under \textsf{LTL} constraints
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
This page was built for publication: Constrained synchronization and subset synchronization problems for weakly acyclic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832939)
