State complexity bounds for the commutative closure of group languages

DOI10.1007/978-3-030-62536-8_6OpenAlexW3109133181MaRDI QIDQ2040410

Stefan Hoffmann

Publication date: 14 July 2021

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

zbMATH Keywords

state complexitycommutative closurepermutation automatongroup language

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (7)

State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ Nondeterministic operational complexity in subregular languages ⋮ Simulation by Rounds of Letter-to-Letter Transducers ⋮ Unnamed Item ⋮ Operations on subregular languages and nondeterministic state complexity ⋮ The commutative closure of shuffle languages over group languages is regular ⋮ State complexity of permutation and related decision problems on alphabetical pattern constraints

This page was built for publication: State complexity bounds for the commutative closure of group languages