Separating Without Any Ambiguity.

DOI10.4230/LIPICS.ICALP.2018.137MaRDI QIDQ5002824zbMATH OpenOpenAlexFDO

Authors 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

decidable characterizationsregular languagesseparation problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Concerning Separability
• Uniform separation
• A simple separation logic
• Separation by ambivalent sets
• Effectivizing Inseparability
• scientific article; zbMATH DE number 4214374
• scientific article; zbMATH DE number 3854443
• On the consistency of a separator
• Generic separations
• Separation and Coding

Cites work

• A homomorphism theorem for finite semigroups
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• An explicit formula for the intersection of two polynomials of regular languages
• Classifying regular events in symbolic logic
• Equations Defining the Polynomial Closure of a Lattice of Regular Languages
• First-order logic with two variables and unary temporal logic
• Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
• scientific article; zbMATH DE number 4035179 (Why is no real title available?)
• scientific article; zbMATH DE number 3702106 (Why is no real title available?)
• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 1944133 (Why is no real title available?)
• scientific article; zbMATH DE number 1775408 (Why is no real title available?)
• scientific article; zbMATH DE number 6851910 (Why is no real title available?)
• Locally trivial categories and unambiguous concatenation
• On decidability of intermediate levels of concatenation hierarchies
• On the structure of semigroups
• Polynomial closure and unambiguous product
• Polynomial closure and unambiguous product
• Polynomial operations and hierarchies of concatenation
• Separating regular languages with two quantifiers alternations
• Separation for dot-depth two
• Sur le produit de concatenation non ambigu
• The dot-depth hierarchy, 45 years later

Cited in

(9)

• Recognizing pro-\(\mathrm{R}\) closures of regular languages
• scientific article; zbMATH DE number 2080660 (Why is no real title available?)
• On All Things Star-Free
• How many times do you need to go back to the future in unary temporal logic?
• All about unambiguous polynomial closure
• The amazing mixed polynomial closure and its applications to two-variable first-order logic
• A generic characterization of generalized unary temporal logic and two-variable first-order logic
• Regular separators for VASS coverability languages
• Dot-depth three, return of the j-class

This page was built for publication: Separating Without Any Ambiguity.

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