Varieties
From MaRDI portal
Publication:2074217
DOI10.4171/Automata-1/16OpenAlexW4200600508MaRDI QIDQ2074217
Publication date: 4 February 2022
Full work available at URL: https://arxiv.org/abs/1502.03951
Related Items (4)
Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words ⋮ Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words ⋮ Shuffle product of regular languages: results and open problems ⋮ Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Elements of finite model theory.
- The Birkhoff theorem for varieties of finite algebras
- Finite-automaton aperiodicity is PSPACE-complete
- Definability with bounded number of bound variables
- Some pseudovariety joins involving the pseudovariety of finite groups
- The method of forced enumeration for nondeterministic automata
- Locally trivial categories and unambiguous concatenation
- Classification of finite monoids: the language approach
- The Birkhoff theorem for finite algebras
- Classifying regular events in symbolic logic
- Regular languages in \(NC\)
- Closure of varieties of languages under products with counter
- On pseudovarieties
- Sur le produit de concatenation non ambigu
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
- Polynomial closure and unambiguous product
- Profinite categories and semidirect products
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Regular languages defined with generalized quantifiers
- The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Finite semigroup varieties of the form V*D
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
- Languages of dot-depth 3/2
- Algebraic recognizability of regular tree languages
- Relationships between nondeterministic and deterministic tape complexities
- Dot-depth of star-free events
- Pointlike sets for varieties determined by groups
- Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
- On logical hierarchies within FO^2-definable languages
- Wreath Products of Forest Algebras, with Applications to Tree Logics
- Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable
- Duality and Equational Theory of Regular Languages
- ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
- A PROFINITE APPROACH TO STABLE PAIRS
- APERIODIC POINTLIKES AND BEYOND
- Equations Defining the Polynomial Closure of a Lattice of Regular Languages
- Nondeterministic Space is Closed under Complementation
- Undecidability of the identity problem for finite semigroups
- Varieties and finite closure conditions
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
- An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic
- Separating Regular Languages with Two Quantifiers Alternations
- Some results onC-varieties
- The Dot-Depth Hierarchy, 45 Years Later
- On Pointlike Sets and Joins of Pseudovarieties
- On the extension problem for partial permutations
- Adding Successor
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- On finite monoids having only trivial subgroups
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Ordering by Divisibility in Abstract Algebras
- On algorithmic problems for joins of pseudovarieties
- A delay theorem for pointlikes
This page was built for publication: Varieties
