Characterizing level one in group-based concatenation hierarchies

DOI10.1007/978-3-031-09574-0_20OpenAlexW4285188676MaRDI QIDQ2097235

Thomas Place, Marc Zeitoun

Publication date: 11 November 2022

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

zbMATH Keywords

regular languagesmembershipgroup languagesconcatenation hierarchies

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (max. 100)

How many times do you need to go back to the future in unary temporal logic?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the Schützenberger product of finite monoids
• Classification of finite monoids: the language approach
• Classifying regular events in symbolic logic
• Programs over semigroups of dot-depth one
• Algebraic tools for the concatenation product.
• Finite semigroup varieties of the form V*D
• Generic results for concatenation hierarchies
• Classification of noncounting events
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
• Going Higher in First-Order Quantifier Alternation Hierarchies on Words
• An Explicit Formula for the Intersection of Two Polynomials of Regular Languages

This page was built for publication: Characterizing level one in group-based concatenation hierarchies