Constrained synchronization and subset synchronization problems for weakly acyclic automata
type: Item
instance of: scholarly article
title: Constrained synchronization and subset synchronization problems for weakly acyclic automata
DOI: 10.1007/978-3-030-81508-0_17
author: Stefan Hoffmann
publication date: 2022-03-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2108.06984
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7498727
zbMATH Keywords: automata theory
zbMATH Keywords: constrained synchronization
zbMATH Keywords: computational complexity
zbMATH Keywords: weakly acyclic automata
zbMATH Keywords: subset synchronization
MaRDI profile type: Publication
OpenAlex ID: W3196516880
cites work: Q5002800
cites work: Preimage problems for deterministic finite automata
cites work: The complexity of intersecting finite automata having few final states
cites work: Synchronizing series-parallel deterministic finite automata with loops and related problems
cites work: Synchronizing words and monoid factorization: a parameterized perspective
cites work: Languages of R-trivial monoids
cites work: Q5509690
cites work: The complexity of theorem-proving procedures
cites work: The existential theory of equations with rational constraints in free groups is PSPACE-complete
cites work: Reset Sequences for Monotonic Automata
cites work: Parallel recognition of series-parallel graphs
cites work: Semicomputable points in Euclidean spaces
cites work: Series parallel digraphs with loops
cites work: Synchronizing Automata of Bounded Rank
cites work: Computational complexity of synchronization under regular commutative constraints
cites work: Q3862379
cites work: On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
cites work: Complexity of universality and related problems for partially ordered NFAs
cites work: Parallel algorithms for solvable permutation groups
cites work: Synchronization of Automata with One Undefined or Ambiguous Transition
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Shortest path under rational constraint
cites work: Polynomial complete problems in automata theory
cites work: Synchronization problems in automata without non-trivial cycles
cites work: Synchronizing Automata and the Černý Conjecture
cites work: Subset synchronization and careful synchronization of binary finite automata
cites work: Complexity of road coloring with prescribed reset words
description: scientific article; zbMATH DE number 7498727