An equivalence relation on suffix codes defined by generalized regular languages

DOI10.1080/00207169008803887MaRDI QIDQ3477988zbMATH OpenOpenAlexFDO

Authors Shuhua Zhang

Publication date 1990

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169008803887

zbMATH Keywords

congruenceequivalence relationfree monoidregular languagessuffix codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4064522
• \(\mathcal{PS}\)-regular languages
• On languages defined by generalized principal right congruences
• scientific article; zbMATH DE number 148019
• scientific article; zbMATH DE number 4051030

Cites work

• Codes conjugués
• Congruences defined by languages and filters

This page was built for publication: An equivalence relation on suffix codes defined by generalized regular languages

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