Ideal separation and general theorems for constrained synchronization and their application to small constraint automata

DOI10.1007/978-3-030-89543-3_15OpenAlexW3208360781MaRDI QIDQ2695284

Stefan Hoffmann

Publication date: 30 March 2023

Full work available at URL: https://arxiv.org/abs/2005.05907

zbMATH Keywords

computational complexityautomata theorysynchronizationfinite automataconstrained synchronization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Constrained synchronization for monotonic and solvable automata and automata with simple idempotents

Cites Work

• Shortest path under rational constraint
• Computational complexity of synchronization under regular commutative constraints
• Complexity of road coloring with prescribed reset words
• The existential theory of equations with rational constraints in free groups is PSPACE-complete
• Synchronizing Automata of Bounded Rank
• Synchronization of Automata with One Undefined or Ambiguous Transition
• Synchronizing Automata and the Černý Conjecture
• Semicomputable points in Euclidean spaces
• Bounded Regular Sets
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ideal separation and general theorems for constrained synchronization and their application to small constraint automata