An efficient algorithm for finding kleene closure of regular expression matrices

DOI10.1007/BF00996818zbMath0509.68074MaRDI QIDQ4747532

Edward T. Lee

Publication date: 1982

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

pattern recognitionautomata theoryKleene closurefuzzy regular expression matrices

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Cites Work

• Unnamed Item
• Unnamed Item
• A Survey of Regular Expressions and Their Applications
• Matrix Equations and Normal Forms for Context-Free Grammars
• A Theorem on Boolean Matrices
• Boolean Matrices and the Stability of Neural Nets

This page was built for publication: An efficient algorithm for finding kleene closure of regular expression matrices