Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
From MaRDI portal
Publication:1250514
DOI10.1016/0304-3975(78)90050-6zbMath0388.20050MaRDI 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
20M05: Free semigroups, generators and relations, word problems
68T99: Artificial intelligence
20M35: Semigroups in automata theory, linguistics, etc.
94A45: Prefix, length-variable, comma-free codes
Related Items
The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction, Biprefix codes, inverse semigroups and syntactic monoids of injective automata, Variétés de langages et monoide des parties, On varieties of rational languages and variable-length codes, 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, Shuffle on positive varieties of languages, Unnamed Item
Cites Work