scientific article; zbMATH DE number 7056235
From MaRDI portal
Thomas Place, Varun Ramanathan, Pascal Weil
Publication date: 17 May 2019
Full work available at URL: https://arxiv.org/abs/1804.08883
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regular languagestheory of computationseparation problemfragments of first-order logicmodular predicatesformal languages and automata theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular languages in \(NC\)
- The dot-depth hierarchy of star-free languages is infinite
- Polynomial closure and unambiguous product
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Finite semigroup varieties of the form V*D
- Concatenation hierarchies: new bottle, old wine
- Separating Regular Languages with First-Order Logic
- Separating Regular Languages by Piecewise Testable and Unambiguous Languages
- Alternation Hierarchies of First Order Logic with Regular Predicates
- Two-variable first order logic with modular predicates over words
- Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes
- APERIODIC POINTLIKES AND BEYOND
- Algebraic and topological theory of languages
- Separating regular languages with two quantifier alternations
- 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
- One quantifier alternation in first-order logic with modular predicates
- Efficient Separability of Regular Languages by Subsequences and Suffixes
- On finite monoids having only trivial subgroups
- A delay theorem for pointlikes