A New Approach to Determinisation Using Bit-Parallelism

DOI10.1007/11921240_16MaRDI QIDQ3525152zbMATH OpenOpenAlexFDO

Authors Jan Šupol, Bořivoj Melichar

Publication date 11 September 2008

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• scientific article; zbMATH DE number 1949653
• Five Determinisation Algorithms

Cited in

(5)

• Five Determinisation Algorithms
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Succinct determinisation of counting automata via sphere construction
• scientific article; zbMATH DE number 1949653 (Why is no real title available?)

This page was built for publication: A New Approach to Determinisation Using Bit-Parallelism

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