scientific article; zbMATH DE number 7152082
From MaRDI portal
Publication:5208373
DOI10.25596/jalc-2019-287zbMath1429.68111MaRDI QIDQ5208373
Henning Fernau, Stefan Hoffmann
Publication date: 15 January 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (11)
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ Extension of some edge graph problems: standard, parameterized and approximation complexity ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ Invited talks ⋮ Unnamed Item ⋮ Constrained synchronization and commutativity ⋮ Computational complexity of synchronization under regular commutative constraints ⋮ On the complexity of solution extension of optimization problems ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems ⋮ The commutative closure of shuffle languages over group languages is regular
This page was built for publication:
