Automata accepting bifix codes

DOI10.25596/JALC-2008-269MaRDI QIDQ5192985zbMATH OpenFDO

Authors Zheng-Zhu Li, H. J. Shyr, Yen-Shung Tsai

Publication date 10 August 2009

zbMATH Keywords

algorithmsdecidabilityfinite automataregular languagesprefix codesvariable-length codesbifix codescomma-free codescomma-codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Decidability of code properties
• Decidability of code properties
• Codes and automata.
• Classifications of bifix codes
• scientific article; zbMATH DE number 826059

Cited in

(10)

• Biprefix codes, inverse semigroups and syntactic monoids of injective automata
• Decidability of code properties
• scientific article; zbMATH DE number 826059 (Why is no real title available?)
• Decidability of code properties
• Generalizations of code languages with marginal errors
• Quadratic algorithms for testing of codes and \(\diamond\)-codes
• Every regular bifix code is a finite union of regular infix codes
• Automates et codes zigzag
• Annihilators of bifix codes
• Deciding unique decodability of bigram counts via finite automata

This page was built for publication: Automata accepting bifix codes

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