A note on the commutative closure of star-free languages

DOI10.1016/0020-0190(95)00187-5zbMath0900.68288OpenAlexW1987017691MaRDI QIDQ672729

Anca Muscholl, Holger Petersen

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00187-5

zbMATH Keywords

Formal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Unnamed Item ⋮ Rational, recognizable, and aperiodic partially lossy queue languages ⋮ The transformation monoid of a partially lossy queue ⋮ Regular languages and partial commutations ⋮ Weighted Linear Dynamic Logic ⋮ Unnamed Item ⋮ A note on partially ordered tree automata ⋮ The commutative closure of shuffle languages over group languages is regular

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Star-free trace languages
• New results on the star problem in trace monoids
• Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable
• On finite monoids having only trivial subgroups

This page was built for publication: A note on the commutative closure of star-free languages