The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
From MaRDI portal
Publication:1748357
DOI10.1515/forum-2016-0028zbMath1429.20040arXiv1601.08237OpenAlexW3098578978MaRDI QIDQ1748357
Michal Kunc, Ondřej Klíma, Jorge Almeida
Publication date: 9 May 2018
Published in: Forum Mathematicum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.08237
pseudovarietyordered monoidStraubing-Thérien hierarchy$\omega$-inequality problemconcatenation hierarchy
Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Ordered semigroups and monoids (06F05)
Related Items
The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies, Pro-aperiodic monoids via saturated models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- A generalization of the Schützenberger product of finite monoids
- Classification of finite monoids: the language approach
- The Birkhoff theorem for finite algebras
- Classifying regular events in symbolic logic
- Polynomial closure and unambiguous product
- Nonstandard characterization of pseudovarieties
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Profinite semigroups, Mal'cev products, and identities
- Finite semigroup varieties of the form V*D
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
- Iterated periodicity over finite aperiodic semigroups
- Equidivisible semigroups
- Dot-depth of star-free events
- Separating Regular Languages with First-Order Logic
- McCammond’s normal forms for free aperiodic semigroups revisited
- Factoriality and the Pin-Reutenauer procedure
- On Decidability of Intermediate Levels of Concatenation Hierarchies
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- Pro-aperiodic monoids via saturated models
- NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- On fixed points of the lower set operator
