Constrained synchronization and subset synchronization problems for weakly acyclic automata
From MaRDI portal
Publication:832939
DOI10.1007/978-3-030-81508-0_17OpenAlexW3196516880MaRDI QIDQ832939FDOQ832939
Authors: Stefan Hoffmann 
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2108.06984
Recommendations
computational complexityautomata theoryconstrained synchronizationsubset synchronizationweakly acyclic automata
Cites Work
- Title not available (Why is that?)
- The complexity of intersecting finite automata having few final states
- Synchronizing Automata and the Černý Conjecture
- The complexity of theorem-proving procedures
- Principles and Practice of Constraint Programming – CP 2004
- Polynomial complete problems in automata theory
- Reset Sequences for Monotonic Automata
- Title not available (Why is that?)
- Parallel algorithms for solvable permutation groups
- Series parallel digraphs with loops
- Parallel recognition of series-parallel graphs
- The existential theory of equations with rational constraints in free groups is PSPACE-complete
- Languages of R-trivial monoids
- Synchronization of automata with one undefined or ambiguous transition
- Shortest path under rational constraint
- 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
- 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
- Title not available (Why is that?)
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Semicomputable points in Euclidean spaces
Cited In (8)
- Constrained synchronization and commutativity
- Computational complexity of synchronization under sparse regular constraints
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
- Subset synchronization and careful synchronization of binary finite automata
- Synchronizing words under \textsf{LTL} constraints
- Title not available (Why is that?)
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- Semicomputable points in Euclidean spaces
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)
