Dynamic programming -- NFA simulation

DOI10.1007/3-540-44977-9_32MaRDI QIDQ4418629zbMATH OpenFDO

Authors Jan Holub

Publication date 11 August 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2608/26080295.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Bit parallelism -- NFA simulation
• scientific article; zbMATH DE number 2201363
• Dynamic programming for reduced NFAs for approximate string and sequence matching.
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity

Cited in

(2)

• Bit parallelism -- NFA simulation
• scientific article; zbMATH DE number 2201363 (Why is no real title available?)

This page was built for publication: Dynamic programming -- NFA simulation

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