Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
From MaRDI portal
Publication:1250514
DOI10.1016/0304-3975(78)90050-6zbMath0388.20050OpenAlexW1985495230MaRDI QIDQ1250514
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(78)90050-6
Free semigroups, generators and relations, word problems (20M05) Artificial intelligence (68T99) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)
Related Items
Shuffle on positive varieties of languages, Variétés de langages et monoide des parties, On varieties of rational languages and variable-length codes, Unnamed Item, The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction, On the syntactic transformation semigroup of a language generated by a finite biprefix code, Variétés de langages et opérations, On characterizations of recursively enumerable languages, Two characterizations of rational adherences, Biprefix codes, inverse semigroups and syntactic monoids of injective automata
Cites Work
