Every regular bifix code is a finite union of regular infix codes

MaRDI QIDQ4988158zbMATH OpenFDO

Authors Stavros Konstantinidis

Publication date 12 May 2021

Full work available at URL http://www.jalc.de/issues/2020/issue_25_1/jalc-2020-055-059.php

zbMATH Keywords

bifix codeinfix coderegular language

Mathematics Subject Classification ID

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

Recommendations

• Classifications of bifix codes
• Automata accepting bifix codes
• Completion of recognizable bifix codes
• Annihilators of bifix codes
• scientific article; zbMATH DE number 4039328

Cites work

• Completion of recognizable bifix codes
• Embedding rationally independent languages into maximal ones
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Lindenmayer systems with control by ideals and codes
• Minimal Union-Free Decompositions of Regular Languages
• Outfix-free regular languages and prime outfix-free decomposition
• Prime Decompositions of Regular Languages
• Regular component decomposition of regular languages.
• The single loop representations of regular languages

Cited in

(1)

• Lindenmayer systems with control by ideals and codes

This page was built for publication: Every regular bifix code is a finite union of regular infix codes

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