On varieties of rational languages and variable-length codes

DOI10.1016/0022-4049(82)90005-6MaRDI QIDQ1161830zbMATH OpenOpenAlexFDO

Authors Jean-Éric Pin

Publication date 1982

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(82)90005-6

zbMATH Keywords

prefix coderegular languagesvarieties of finite semigroupsaperiodic languagespure star operation

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Decoding (94B35) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)

Cites work

• scientific article; zbMATH DE number 3653583 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3724720 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3559875 (Why is no real title available?)
• scientific article; zbMATH DE number 3583696 (Why is no real title available?)
• scientific article; zbMATH DE number 3583697 (Why is no real title available?)
• scientific article; zbMATH DE number 3624806 (Why is no real title available?)
• scientific article; zbMATH DE number 3639171 (Why is no real title available?)
• scientific article; zbMATH DE number 3640907 (Why is no real title available?)
• scientific article; zbMATH DE number 3436628 (Why is no real title available?)
• scientific article; zbMATH DE number 3305059 (Why is no real title available?)
• Aperiodic homomorphisms and the concatenation product of recognizable sets
• Codes with bounded synchronization delay
• Families of recognizable sets corresponding to certain varieties of finite monoids
• On a question of McNaughton and Papert
• Properties of code events and homomorphisms over regular events
• Recognizable sets and power sets of finite semigroups
• Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
• Sur le produit de concatenation non ambigu
• Variétés de langages et monoide des parties
• Variétés de langages et opérations

Cited in

(3)

• Biprefix codes, inverse semigroups and syntactic monoids of injective automata
• On the syntactic transformation semigroup of a language generated by a finite biprefix code
• On varieties of rational languages and variable length codes. II

This page was built for publication: On varieties of rational languages and variable-length codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1161830)