scientific article
From MaRDI portal
Publication:3913600
zbMath0463.20049MaRDI QIDQ3913600
Publication date: 1981
Full work available at URL: https://eudml.org/doc/92139
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
recognizable languagessyntactic monoidsvariety of languagesrecognizable setsaperiodic relational morphismpure submonoid
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
On varieties of rational languages and variable length codes. II ⋮ A property of the Schützenberger product ⋮ Locally trivial categories and unambiguous concatenation ⋮ Polynomial closure and unambiguous product ⋮ On varieties of rational languages and variable-length codes ⋮ Algebraic and topological theory of languages ⋮ Theme and Variations on the Concatenation Product ⋮ Actions, wreath products of \(\mathcal C\)-varieties and concatenation product. ⋮ The expressive power of the shuffle product ⋮ Fuzzy homomorphisms of algebras ⋮ Algebraic tools for the concatenation product. ⋮ A conjecture on the concatenation product
Cites Work
- Recognizable sets and power sets of finite semigroups
- Variétés de langages et monoide des parties
- A generalization of the Schützenberger product of finite monoids
- Sur le produit de concatenation non ambigu
- Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
- Variétés de langages et opérations
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- On finite monoids having only trivial subgroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
