Constrained synchronization and subset synchronization problems for weakly acyclic automata
From MaRDI portal
Publication:832939
DOI10.1007/978-3-030-81508-0_17OpenAlexW3196516880MaRDI QIDQ832939
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2108.06984
computational complexityautomata theoryconstrained synchronizationsubset synchronizationweakly acyclic automata
Related Items (2)
Constrained synchronization for monotonic and solvable automata and automata with simple idempotents ⋮ Constrained synchronization and commutativity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of intersecting finite automata having few final states
- Series parallel digraphs with loops
- Parallel algorithms for solvable permutation groups
- Shortest path under rational constraint
- Languages of R-trivial monoids
- Parallel recognition of series-parallel graphs
- Polynomial complete problems in automata theory
- Complexity of universality and related problems for partially ordered NFAs
- Computational complexity of synchronization under regular commutative constraints
- Synchronizing words and monoid factorization: a parameterized perspective
- Preimage problems for deterministic finite automata
- Complexity of road coloring with prescribed reset words
- The existential theory of equations with rational constraints in free groups is PSPACE-complete
- Subset Synchronization and Careful Synchronization of Binary Finite Automata
- Synchronizing Automata of Bounded Rank
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- Synchronization of Automata with One Undefined or Ambiguous Transition
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Semicomputable points in Euclidean spaces
- The complexity of theorem-proving procedures
- Principles and Practice of Constraint Programming – CP 2004
- Synchronization problems in automata without non-trivial cycles
This page was built for publication: Constrained synchronization and subset synchronization problems for weakly acyclic automata
