A counterexample to a conjecture concerning concatenation hierarchies

DOI10.1016/j.ipl.2009.09.011zbMath1206.68165OpenAlexW2042514722WikidataQ122932637 ScholiaQ122932637MaRDI QIDQ990089

Ondřej Klíma, Jorge Almeida

Publication date: 2 September 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.09.011

zbMATH Keywords

formal languagesregular languagesstar-free languagesconcatenation hierarchieslevel two

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Semigroups and languages of dot-depth two
• The Birkhoff theorem for finite algebras
• On a conjecture concerning dot-depth two languages
• Polynomial closure and unambiguous product
• A Reiterman theorem for pseudovarieties of finite first-order structures
• Profinite semigroups, Mal'cev products, and identities
• A conjecture on the concatenation product
• INVERSE MONOIDS OF DOT-DEPTH TWO
• On the extension problem for partial permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A counterexample to a conjecture concerning concatenation hierarchies