Constrained synchronization and commutativity
From MaRDI portal
Publication:2235741
Recommendations
Cites work
- Characterization and complexity results on jumping finite automata
- Commutative regular languages -- properties and state complexity
- Complexity of preimage problems for deterministic finite automata
- Computational complexity of synchronization under regular commutative constraints
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Extensions to minimal synchronizing words
- scientific article; zbMATH DE number 4101157 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 897906 (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?)
- Introduction to algorithms.
- Learning Commutative Regular Languages
- Model-based testing of reactive systems. Advanced lectures.
- On the computational complexity of problems related to distinguishability sets
- Parametrized complexity theory.
- Polynomial complete problems in automata theory
- Principles and Practice of Constraint Programming – CP 2004
- Problems on finite automata and the exponential time hypothesis
- Relationships between nondeterministic and deterministic tape complexities
- Semicomputable points in Euclidean spaces
- Shortest path under rational constraint
- Space-bounded reducibility among combinatorial problems
- Synchronization of automata with one undefined or ambiguous transition
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata of bounded rank
- The complexity of satisfiability problems
- The existential theory of equations with rational constraints in free groups is PSPACE-complete
Cited in
(14)- Computational complexity of synchronization under regular commutative constraints
- Sync-maximal permutation groups equal primitive permutation groups
- Computational complexity of synchronization under sparse regular constraints
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- Compatibility and commutativity of lock modes
- Semicomputable points in Euclidean spaces
- Synchronization of Parikh automata
- Completely distinguishable automata and the set of synchronizing words
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
- New characterizations of primitive permutation groups with applications to synchronizing automata
- Subset mapping problems in solvable automata
- Completely distinguishable automata and the set of synchronizing words
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
This page was built for publication: Constrained synchronization and commutativity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235741)
