Smaller representation of finite state automata

DOI10.1016/j.tcs.2012.04.023zbMath1243.68200OpenAlexW2033952804MaRDI QIDQ442137

Dawid Weiss, Jan Daciuk

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)

Cites Work

• Unnamed Item
• Unnamed Item
• How to squeeze a lexicon
• Storing a sparse table
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Implementation and Application of Automata

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