Separation for dot-depth two

MaRDI QIDQ5144616zbMATH OpenFDO

Authors Thomas Place, Marc Zeitoun

Publication date 19 January 2021

Full work available at URL http://dl.acm.org/citation.cfm?id=3330005

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Recommendations

• The dot-depth hierarchy, 45 years later
• Around dot-depth one
• Around dot-depth one
• scientific article; zbMATH DE number 2080228
• scientific article; zbMATH DE number 1500543

Cited in

(14)

• Generic results for concatenation hierarchies
• Separation and the successor relation
• Separating regular languages with two quantifier alternations
• The covering problem
• The dot-depth hierarchy, 45 years later
• Efficient algorithms for membership in Boolean hierarchies of regular languages
• Unboundedness problems for languages of vector addition systems
• Separating Without Any Ambiguity.
• Approximating probabilistic automata by regular languages
• The Complexity of Separation for Levels in Concatenation Hierarchies
• On All Things Star-Free
• Separation for dot-depth two
• Covering and separation for logical fragments with modular predicates
• Pointlike sets and separation: a personal perspective

This page was built for publication: Separation for dot-depth two

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