The syntactic monoid of the semigroup generated by a maximal prefix code

DOI10.1090/S0002-9939-96-03271-6zbMATH Open0852.20058MaRDI QIDQ4875509FDOQ4875509

Authors: Mario Petrich, Gabriel Thierrin, Cecília M. Reis 

Publication date: 8 December 1996

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Recommendations

• On syntactic groups.
• The syntactic monoid of the semigroup generated by a comma-free code
• Recent results on syntactic groups of prefix codes.
• Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes

zbMATH Keywords

syntactic congruencessyntactic monoidsright groupsprefix codessemantic congruencesright zero semigroupsrelatively general codes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• The syntactic monoid of hairpin-free languages
• Biprefix codes, inverse semigroups and syntactic monoids of injective automata
• The Syntactic Monoid of an Infix Code
• On the groups of codes with empty kernel.
• Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups
• Title not available (Why is that?)

This page was built for publication: The syntactic monoid of the semigroup generated by a maximal prefix code

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