Commutative regular languages -- properties and state complexity

DOI10.1007/978-3-030-21363-3_13zbMath1434.68258OpenAlexW2951982070MaRDI QIDQ2175417

Stefan Hoffmann

Publication date: 29 April 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-21363-3_13

zbMATH Keywords

shuffleautomata theorystate complexitycommutative language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ Unnamed Item ⋮ Constrained synchronization and commutativity ⋮ Computational complexity of synchronization under regular commutative constraints ⋮ Commutative regular languages with product-form minimal automata ⋮ State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages ⋮ Regularity conditions for iterated shuffle on commutative regular languages ⋮ The commutative closure of shuffle languages over group languages is regular

This page was built for publication: Commutative regular languages -- properties and state complexity