Separating Without Any Ambiguity.

DOI10.4230/LIPIcs.ICALP.2018.137zbMath1499.68192OpenAlexW2885779043MaRDI QIDQ5002824

Thomas Place, Marc Zeitoun

Publication date: 28 July 2021

Full work available at URL: https://dblp.uni-trier.de/db/conf/icalp/icalp2018.html#PlaceZ18

zbMATH Keywords

regular languagesseparation problemdecidable characterizations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

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
• Unnamed Item
• Unnamed Item
• Locally trivial categories and unambiguous concatenation
• Classifying regular events in symbolic logic
• Polynomial operations and hierarchies of concatenation
• Sur le produit de concatenation non ambigu
• Polynomial closure and unambiguous product
• First-order logic with two variables and unary temporal logic
• On the structure of semigroups
• On Decidability of Intermediate Levels of Concatenation Hierarchies
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• Equations Defining the Polynomial Closure of a Lattice of Regular Languages
• Separating Regular Languages with Two Quantifiers Alternations
• Polynomial closure and unambiguous product
• The Dot-Depth Hierarchy, 45 Years Later
• Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
• An Explicit Formula for the Intersection of Two Polynomials of Regular Languages
• A homomorphism theorem for finite semigroups