On varieties of rational languages and variable-length codes

DOI10.1016/0022-4049(82)90005-6zbMath0481.20042MaRDI QIDQ1161830

Jean-Eric 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 code; regular languages; varieties of finite semigroups; aperiodic languages; pure star operation

Mathematics Subject Classification ID

20M07: Varieties and pseudovarieties of semigroups

68Q70: Algebraic theory of languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

94B35: Decoding

Related Items

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

Cites Work

• Families of recognizable sets corresponding to certain varieties of finite monoids
• Recognizable sets and power sets of finite semigroups
• Variétés de langages et monoide des parties
• Properties of code events and homomorphisms over regular events
• 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 a question of McNaughton and Papert
• Codes with bounded synchronization delay
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item