A New Approach to Determinisation Using Bit-Parallelism

DOI10.1007/11921240_16zbMATH Open1168.68416OpenAlexW1563521990MaRDI QIDQ3525152FDOQ3525152

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Title not available (Why is that?)
• Five Determinisation Algorithms

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)