On varieties of rational languages and variable length codes. II

DOI10.1016/0022-4049(86)90111-8zbMath0598.20063MaRDI 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

zbMATH Keywords

concatenation; *-variety of languages; finite prefix codes; variety of monoids

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20M07: Varieties and pseudovarieties of semigroups

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

94A45: Prefix, length-variable, comma-free codes

Related Items

Unnamed Item, The complexity of intersecting finite automata having few final states, Inverse semigroups and varieties of finite semigroups, Polynomials, fragments of temporal logic and the variety DA over traces, On the syntactic transformation semigroup of a language generated by a finite biprefix code, Parikh-reducing Church-Rosser representations for some classes of regular languages

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