Recognizing regular expressions by means of dataflow networks

DOI10.1007/3-540-61440-0_140MaRDI QIDQ4818847zbMATH OpenFDO

Authors Pascal Raymond

Publication date 24 September 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61440-0_140

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Circuit complexity of regular languages
• Algorithms for the compilation of regular expressions into PLAs
• From regular expressions to deterministic automata
• From regular expressions to DFA's using compressed NFA's
• A constructing method of regular expression's smaller -NFA

Cited in

(2)

• Regular expressions for decoding of neural network outputs
• scientific article; zbMATH DE number 4001459 (Why is no real title available?)

This page was built for publication: Recognizing regular expressions by means of dataflow networks

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