Experiments with automata compression

DOI10.1007/3-540-44674-5_8MaRDI QIDQ4544428zbMATH OpenFDO

Authors Jan Daciuk

Publication date 4 August 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44674-5_8

zbMATH Keywords

compression methods finite-state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50) Computing methodologies and applications (68U99)

Recommendations

• Compression of finite-state automata through failure transitions
• Data compression with factor automata
• Computer Science Logic
• Compressed membership in automata with compressed labels
• Combinatorial Pattern Matching
• The complexity of compressed membership problems for finite automata
• Experimental Evaluation of Classical Automata Constructions
• Minimisation of automata
• scientific article; zbMATH DE number 4011948

Cited in

(8)

• Context Model Automata for Text Compression
• Smaller representation of finite state automata
• scientific article; zbMATH DE number 2081049 (Why is no real title available?)
• Using ranked semirings for representing morphology automata
• Smaller representation of finite state automata
• Computer Science Logic
• Combinatorial Pattern Matching
• Smaller representation of compiled regular expressions

This page was built for publication: Experiments with automata compression

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