On the syntactic transformation semigroup of a language generated by a finite biprefix code

DOI10.1016/0304-3975(89)90085-6zbMath0486.68078OpenAlexW2074836723MaRDI QIDQ1165022

Stuart W. Margolis

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90085-6

zbMATH Keywords

idempotentbiprefix codepartial one to one mapssyntactic transformation semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (4)

On varieties of rational languages and variable length codes. II ⋮ Inverse semigroups and varieties of finite semigroups ⋮ A hierarchy of shift equivalent sofic shifts ⋮ Biprefix codes, inverse semigroups and syntactic monoids of injective automata

Cites Work

• Unnamed Item
• On varieties of rational languages and variable length codes. II
• Une topologie du monoide libre
• Sur mon article Une topologie du monoide libre
• On varieties of rational languages and variable-length codes
• On the complexity of finite semigroups
• Sur le produit de concatenation non ambigu
• Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
• On certain codes admitting inverse semigroups as syntactic monoids

This page was built for publication: On the syntactic transformation semigroup of a language generated by a finite biprefix code