On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
From MaRDI portal
Publication:751686
DOI10.1007/BF01190713zbMATH Open0715.08006OpenAlexW2023227558MaRDI QIDQ751686FDOQ751686
Authors: Jorge Almeida 
Publication date: 1990
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01190713
Recommendations
- On Varieties of Literally Idempotent Languages
- Varieties and covarieties of languages (extended abstract)
- On the variety of strict pseudosemilattices
- scientific article; zbMATH DE number 4031757
- scientific article; zbMATH DE number 17829
- scientific article; zbMATH DE number 4067251
- scientific article; zbMATH DE number 512864
- On syntactic congruences for \(\omega\)-languages
- A note on pure and \(p\)-pure languages
- \(M\)-solid varieties of languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On pseudovarieties
- Title not available (Why is that?)
- The Birkhoff theorem for finite algebras
- The Birkhoff theorem for varieties of finite algebras
- Pseudovarieties, generalized varieties and similarly described classes
- The lattices of varieties and pseudovarieties of band monoids
- Some Order Properties of the Lattice of Varieties of Commutative Semigroups
- The algebra of implicit operations
Cited In (41)
- On Correspondences Between Unary Algebras, Automata, Semigroups and Congruences
- Algebras for classifying regular tree languages and an application to frontier testability
- Title not available (Why is that?)
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
- Nonstandard characterization of pseudovarieties
- Towards a pseudoequational proof theory
- Bases for pseudovarieties closed under bideterministic product
- Profinite monads, profinite equations, and Reiterman's theorem
- A unified syntactical approach to theorems of Putcha, Margolis, and Straubing on finite power semigroups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatizing the equational theory of regular tree languages
- Strongly locally testable semigroups with commuting idempotents and related languages
- Aperiodicity in Tree Automata
- The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups
- Tree algebras and varieties of tree languages
- Algebraic characterization of logically defined tree languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pseudovarieties, generalized varieties and similarly described classes
- Generalized contexts and \(n\)-ary syntactic semigroups of tree languages.
- Over testable languages
- Regular languages and Stone duality
- Three notes on distributive lattices
- Classifying regular languages by their syntactic algebras
- Structure of lattices of varieties and lattices of quasivarieties: Similarity and difference. I
- Varieties of recognizable tree series over fields
- Characterizing CTL-like logics on finite trees.
- General varieties of tree languages
- Positive varieties of tree languages
- Fuzzy identity filters and fuzzy subpseudovarieties
- Eilenberg Theorems for Free
- Unary algebras, semigroups and congruences on free semigroups
- Languages recognized by finite aperiodic groupoids
- Profinite topologies
- Algebraic recognizability of regular tree languages
- Semidirect products of pseudovarieties from the universal algebraist's point of view
- Mathematical Foundations of Computer Science 2004
- On finite simple semigroups
- The linear nature of pseudowords
- An algebraic characterization of frontier testable tree languages
This page was built for publication: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751686)
