EQUATIONAL DESCRIPTIONS OF LANGUAGES
From MaRDI portal
Publication:4923277
DOI10.1142/S0129054112400497zbMath1283.68224MaRDI QIDQ4923277
Publication date: 6 June 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (4)
Dual Space of a Lattice as the Completion of a Pervin Space ⋮ Ultrafilters on words for a fragment of logic ⋮ A topological approach to non-uniform complexity ⋮ Stone duality, topological algebra, and recognition.
Cites Work
- Unnamed Item
- Regular languages and Stone duality
- The expressive power of the shuffle product
- The Birkhoff theorem for varieties of finite algebras
- Automata on linear orderings
- First-order logic and star-free sets
- The Birkhoff theorem for finite algebras
- Classifying regular events in symbolic logic
- Regular languages in \(NC\)
- Some results on the generalized star-height problem
- Polynomial closure of group languages and open sets of the Hall topology
- Polynomial closure and unambiguous product
- Decomposition of the lattice of pseudovarieties of finite semigroups induced by bands
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
- Bases for equational theories of semi-groups
- PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
- Some results onC-varieties
- On finite monoids having only trivial subgroups
This page was built for publication: EQUATIONAL DESCRIPTIONS OF LANGUAGES