Smaller representation of finite state automata
Authors:
- 7 September 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 450, 10-21
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Natural Language Dictionaries Implemented as Finite Automata2010
- Gazetteer Compression Technique Based on Substructure Recognition2007
- How to squeeze a lexiconSoftware: Practice and Experience, 2001
- Incremental construction of minimal acyclic finite state automata and transducers1998
- Applications of finite automata representing large vocabulariesSoftware: Practice and Experience, 1993
- Optimization of parser tables for portable compilersACM Transactions on Programming Languages and Systems, 1984
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Storing a sparse tableCommunications of the ACM, 1979