On varieties of rational languages and variable length codes. II
From MaRDI portal
Publication:1079669
DOI10.1016/0022-4049(86)90111-8zbMath0598.20063OpenAlexW4239470957MaRDI QIDQ1079669
Jean-Eric Pin, Stuart W. Margolis
Publication date: 1986
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-4049(86)90111-8
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)
Related Items
The complexity of intersecting finite automata having few final states ⋮ Polynomials, fragments of temporal logic and the variety DA over traces ⋮ Parikh-reducing Church-Rosser representations for some classes of regular languages ⋮ On the syntactic transformation semigroup of a language generated by a finite biprefix code ⋮ Inverse semigroups and varieties of finite semigroups ⋮ The Power of Programs over Monoids in DA
Cites Work
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Regular semigroups with D=R as syntactic monoids of prefix codes
- Sur le calcul du monoide syntaxique d'un sous monoide finiment engendre
- On varieties of rational languages and variable-length codes
- On the syntactic transformation semigroup of a language generated by a finite biprefix code
- Cyclotomic polynomials and unions of groups
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Finite semigroup varieties of the form V*D
- Decomposition and complexity of finite semigroups
- On a question of McNaughton and Papert
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item