A Run-Time Efficient Implementation of Compressed Pattern Matching Automata

DOI10.1007/978-3-540-70844-5_21zbMath1172.68519MaRDI QIDQ3602815

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

68Q45: Formal languages and automata

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68U15: Computing methodologies for text processing; mathematical typography

Cites Work

• Let sleeping files lie: Pattern matching in Z-compressed files.
• Collage system: A unifying framework for compressed pattern matching.
• Grammar-based codes: a new class of universal lossless source codes
• Unnamed Item
• Unnamed Item
• Unnamed Item