Varieties (Q2074217)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Varieties	scientific article

Statements

scholarly article

0 references

Varieties (English)

0 references

Howard Straubing

0 references

0 references

publication date

4 February 2022

0 references

full work available at URL

https://arxiv.org/abs/1502.03951

0 references

Summary: For the entire collection see [Zbl 1470.68001].

0 references

MaRDI profile type

MaRDI publication profile

0 references

Undecidability of the identity problem for finite semigroups

0 references

Some pseudovariety joins involving the pseudovariety of finite groups

0 references

0 references

The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids

0 references

PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS

0 references

Profinite categories and semidirect products

0 references

On the extension problem for partial permutations

0 references

Varieties and finite closure conditions

0 references

The Birkhoff theorem for varieties of finite algebras

0 references

Regular languages in \(NC\)

0 references

0 references

0 references

Wreath Products of Forest Algebras, with Applications to Tree Logics

0 references

0 references

Equations Defining the Polynomial Closure of a Lattice of Regular Languages

0 references

0 references

Finite-automaton aperiodicity is PSPACE-complete

0 references

Dot-depth of star-free events

0 references

0 references

On pseudovarieties

0 references

Algebraic recognizability of regular tree languages

0 references

ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES

0 references

The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy

0 references

Duality and Equational Theory of Regular Languages

0 references

Languages of dot-depth 3/2

0 references

Pointlike sets: the finest aperiodic cover of a finite semigroup

0 references

APERIODIC POINTLIKES AND BEYOND

0 references

A PROFINITE APPROACH TO STABLE PAIRS

0 references

Ordering by Divisibility in Abstract Algebras

0 references

0 references

Nondeterministic Space is Closed under Complementation

0 references

Definability with bounded number of bound variables

0 references

0 references

An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic

0 references

Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines

0 references

Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable

0 references

On logical hierarchies within FO^2-definable languages

0 references

Elements of finite model theory.

0 references

0 references

0 references

The Dot-Depth Hierarchy, 45 Years Later

0 references

Some results on<i>C</i>-varieties

0 references

Locally trivial categories and unambiguous concatenation

0 references

A Reiterman theorem for pseudovarieties of finite first-order structures

0 references

Polynomial closure and unambiguous product

0 references

Separating Regular Languages with Two Quantifiers Alternations

0 references

0 references

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words

0 references

Adding Successor

0 references

The Birkhoff theorem for finite algebras

0 references

Relationships between nondeterministic and deterministic tape complexities

0 references

On finite monoids having only trivial subgroups

0 references

Sur le produit de concatenation non ambigu

0 references

0 references

0 references

On Pointlike Sets and Joins of Pseudovarieties

0 references

A delay theorem for pointlikes

0 references

On algorithmic problems for joins of pseudovarieties

0 references

Aperiodic homomorphisms and the concatenation product of recognizable sets

0 references

Families of recognizable sets corresponding to certain varieties of finite monoids

0 references

Finite semigroup varieties of the form V*D

0 references

0 references

Regular languages defined with generalized quantifiers

0 references

The method of forced enumeration for nondeterministic automata

0 references

Classification of finite monoids: the language approach

0 references

0 references

Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy

0 references

Classifying regular events in symbolic logic

0 references

Categories as algebra: An essential ingredient in the theory of monoids

0 references

The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups

0 references

Pointlike sets for varieties determined by groups

0 references

Closure of varieties of languages under products with counter

0 references

AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS

0 references

0 references

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.4171/AUTOMATA-1/16

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2074217

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2074217&oldid=38865721"