Varieties
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5872386 (Why is no real title available?)
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3552814 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 1304310 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1775408 (Why is no real title available?)
- scientific article; zbMATH DE number 1848280 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3229502 (Why is no real title available?)
- scientific article; zbMATH DE number 3019695 (Why is no real title available?)
- A Reiterman theorem for pseudovarieties of finite first-order structures
- A delay theorem for pointlikes
- A profinite approach to stable pairs.
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- APERIODIC POINTLIKES AND BEYOND
- Adding Successor
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Algebraic characterization of logically defined tree languages
- Algebraic recognizability of regular tree languages
- An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic
- An effective characterization of the alternation hierarchy in two-variable logic
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Categories as algebra: An essential ingredient in the theory of monoids
- Classification of finite monoids: the language approach
- Classifying regular events in symbolic logic
- Closure of varieties of languages under products with counter
- Covering and separation for logical fragments with modular predicates
- Definability with bounded number of bound variables
- Dot-depth of star-free events
- Duality and Equational Theory of Regular Languages
- Elements of finite model theory.
- Equations Defining the Polynomial Closure of a Lattice of Regular Languages
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Finite semigroup varieties of the form V*D
- Finite-automaton aperiodicity is PSPACE-complete
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Languages of dot-depth 3/2
- Locally trivial categories and unambiguous concatenation
- Nondeterministic Space is Closed under Complementation
- On Pointlike Sets and Joins of Pseudovarieties
- On algorithmic problems for joins of pseudovarieties
- On finite monoids having only trivial subgroups
- On logical hierarchies within \(\mathrm{FO}^{2}\)-definable languages
- On pseudovarieties
- On the extension problem for partial permutations
- Ordering by Divisibility in Abstract Algebras
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
- Pointlike sets for varieties determined by groups
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Polynomial closure and unambiguous product
- Profinite categories and semidirect products
- Quantifier alternation in two-variable first-order logic with successor is decidable
- Regular languages defined with generalized quantifiers
- Regular languages in \(NC\)
- Relationships between nondeterministic and deterministic tape complexities
- Separating regular languages with two quantifiers alternations
- Some algorithmic problems for pseudovarieties
- Some pseudovariety joins involving the pseudovariety of finite groups
- Some results onC-varieties
- Sur le produit de concatenation non ambigu
- Temporal logic and semidirect products: An effective characterization of the until hierarchy
- The Birkhoff theorem for finite algebras
- The Birkhoff theorem for varieties of finite algebras
- The dot-depth hierarchy, 45 years later
- The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
- The method of forced enumeration for nondeterministic automata
- Undecidability of the identity problem for finite semigroups
- Varieties and finite closure conditions
- Wreath products of forest algebras, with applications to tree logics
Cited in
(12)- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words
- Varieties of shells
- scientific article; zbMATH DE number 3922854 (Why is no real title available?)
- Subvarieties of the Variety of Meadows
- Legendrian varieties
- Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words
- On the variety question for wRRA
- Balanced varieties
- Shuffle product of regular languages: results and open problems
- Varieties of Togliatti type
- Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words
- Hessenberg Varieties
This page was built for publication: Varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074217)
