Smaller representation of finite state automata

DOI10.1016/J.TCS.2012.04.023MaRDI QIDQ442137zbMATH OpenOpenAlexFDO

Authors Jan Daciuk, Dawid Weiss

Publication date 9 August 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.04.023

zbMATH Keywords

minimal automatadictionary compressionspace-efficient finite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50)

Recommendations

• Smaller representation of finite state automata
• scientific article; zbMATH DE number 1045406
• scientific article; zbMATH DE number 1775629
• A fast and compact technique of implementing transition tables for finite state automata
• scientific article; zbMATH DE number 2081049

Cites work

• scientific article; zbMATH DE number 2185642 (Why is no real title available?)
• How to squeeze a lexicon
• Implementation and Application of Automata
• Natural language dictionaries implemented as finite automata
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Storing a sparse table

Cited in

(7)

• scientific article; zbMATH DE number 1949646 (Why is no real title available?)
• Fixing the state budget: approximation of regular languages with small DFAs
• scientific article; zbMATH DE number 2081049 (Why is no real title available?)
• A fast and compact technique of implementing transition tables for finite state automata
• An efficient representation for implementing finite state machines based on the double-array
• Smaller representation of finite state automata
• Combinatorial Pattern Matching

This page was built for publication: Smaller representation of finite state automata

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