A note on the commutative closure of star-free languages

DOI10.1016/0020-0190(95)00187-5MaRDI QIDQ672729zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1222104
• When Does Partial Commutative Closure Preserve Regularity?
• Regular languages and partial commutations
• scientific article; zbMATH DE number 3936538
• Computing the closure of sets of words under partial commutations

Cites work

• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3624811 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• New results on the star problem in trace monoids
• On finite monoids having only trivial subgroups
• Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract)
• Star-free trace languages

Cited in

(20)

• Remarks about commutative context-free languages
• On the starheight of some rational subsets closed under partial commutations
• Scattered deletion and commutativity
• The commutative closure of a binary slip-language is context-free: A new proof.
• The commutative closure of shuffle languages over group languages is regular
• The transformation monoid of a partially lossy queue
• Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
• When Does Partial Commutative Closure Preserve Regularity?
• scientific article; zbMATH DE number 3936538 (Why is no real title available?)
• Regular languages and partial commutations
• Computing the closure of sets of words under partial commutations
• Every commutative quasirational language is regular
• Partially-commutative context-free languages
• Weighted linear dynamic logic
• Rational, recognizable, and aperiodic partially lossy queue languages
• On All Things Star-Free
• Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
• Weighted Linear Dynamic Logic
• A class of rational trace relations closed under composition
• A note on partially ordered tree automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672729)