REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT

DOI10.1142/S0218196704002018zbMath1074.20036OpenAlexW1996149733MaRDI QIDQ4658714

Mikhail V. Volkov

Publication date: 18 March 2005

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196704002018

zbMATH Keywords

finite basis problempiecewise testable languagespseudovarieties of finite monoidsreflexive relationsextensive transformationsorder preserving transformations\(\mathcal J\)-trivial monoids

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (23)

ORDERED SEMIGROUPS, UPPER-TRIANGULAR REFLEXIVE RELATIONS AND SEMIGROUPS OF LANGUAGES ⋮ Representations and identities of plactic-like monoids ⋮ On join irreducible \(J\)-trivial semigroups ⋮ Identities of the stylic monoid ⋮ Finite basis problem for Catalan monoids with involution ⋮ Identities of the Kauffman monoid K3 ⋮ The finite basis problem for Kiselman monoids. ⋮ Tropical representations and identities of the stylic monoid ⋮ Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups ⋮ Hierarchies of Piecewise Testable Languages ⋮ Monoid varieties with extreme properties ⋮ Identities in unitriangular and gossip monoids ⋮ Finite basis problem for involution monoids of unitriangular Boolean matrices ⋮ HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES ⋮ ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES ⋮ Equational theories of upper triangular tropical matrix semigroups ⋮ Non-finitely based monoids. ⋮ Finitely based monoids. ⋮ Matrix semigroups over semirings ⋮ Low Growth Equational Complexity ⋮ Coregular semigroups of full transformations ⋮ Finite basis problem for the variety generated by all monoids of order five ⋮ Identities and bases in the hypoplactic monoid

Cites Work

• Equations and dot-depth one
• Characterizations of some classes of regular events
• Partially ordered finite monoids and a theorem of I. Simon
• On finite \(\mathcal J\)-trivial monoids
• The finiteness of a base of identities for five-element monoids
• On pseudovarieties
• Equations and monoid varieties of dot-depth one and two
• A proof of Simon's theorem on piecewise testable languages
• Games, equations and the dot-depth hierarchy
• Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon

This page was built for publication: REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT