An efficient algorithm for finding kleene closure of regular expression matrices

DOI10.1007/BF00996818MaRDI QIDQ4747532zbMATH OpenFDO

Authors Edward T. Lee

Publication date 1982

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

Full work available at URL https://doi.org/10.1007/BF00996818

zbMATH Keywords

automata theoryfuzzy regular expression matricesKleene closurepattern recognition

Mathematics Subject Classification ID

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

Cites work

• A Survey of Regular Expressions and Their Applications
• A Theorem on Boolean Matrices
• Boolean Matrices and the Stability of Neural Nets
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Matrix Equations and Normal Forms for Context-Free Grammars

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

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