On All Things Star-Free

DOI10.4230/LIPIcs.ICALP.2019.126OpenAlexW4288985545MaRDI QIDQ5092328

Thomas Place, Marc Zeitoun

Publication date: 21 July 2022

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

zbMATH Keywords

regular languagesseparation problemgroup languagesstar-free closure

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locally trivial categories and unambiguous concatenation
• Decidability of complexity one-half for finite semigroups
• Classifying regular events in symbolic logic
• Regular languages in \(NC\)
• Aperiodic homomorphisms and the concatenation product of recognizable sets
• Abelian pointlikes of a monoid
• Pointlike sets: the finest aperiodic cover of a finite semigroup
• Dot-depth of star-free events
• Separating Regular Languages with First-Order Logic
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• Separating regular languages with two quantifier alternations
• Characterizing classes of regular languages using prefix codes of bounded synchronization delay
• Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay
• Separating Regular Languages with Two Quantifiers Alternations
• The Dot-Depth Hierarchy, 45 Years Later
• Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
• On finite monoids having only trivial subgroups

This page was built for publication: On All Things Star-Free