A Run-Time Efficient Implementation of Compressed Pattern Matching Automata

DOI10.1007/978-3-540-70844-5_21MaRDI QIDQ3602815zbMATH OpenOpenAlexFDO

Authors Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda

Publication date 12 February 2009

Published in Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_21

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA
• A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
• scientific article; zbMATH DE number 1615280
• scientific article; zbMATH DE number 1786459
• Compressed automata for dictionary matching

Cites work

• Collage system: A unifying framework for compressed pattern matching.
• Grammar-based codes: a new class of universal lossless source codes
• scientific article; zbMATH DE number 1615280 (Why is no real title available?)
• scientific article; zbMATH DE number 1629861 (Why is no real title available?)
• scientific article; zbMATH DE number 2087042 (Why is no real title available?)
• Let sleeping files lie: Pattern matching in Z-compressed files.

Cited in

(2)

• A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA
• Context Model Automata for Text Compression

This page was built for publication: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata

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