An equivalence relation on suffix codes defined by generalized regular languages

DOI10.1080/00207169008803887zbMath0699.68102OpenAlexW2044233152MaRDI QIDQ3477988

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

congruenceregular languagessuffix codesfree monoidequivalence relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

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