An efficient representation for implementing finite state machines based on the double-array

DOI10.1016/S0020-0255(00)00061-XMaRDI QIDQ5946284zbMATH OpenOpenAlexFDO

Authors Shoji Mizobuchi, Toru Sumitomo, Masao Fuketa, Jun-ichi Aoe

Publication date 2 January 2002

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(00)00061-x

zbMATH Keywords

double-array structure

Mathematics Subject Classification ID

Data structures (68P05) Formal languages and automata (68Q45)

Recommendations

• A fast and compact technique of implementing transition tables for finite state automata
• A new compression method of double array for compact dictionaries
• Fast insertion methods of a double-array structure
• Smaller representation of finite state automata
• Smaller representation of finite state automata

Cites work

• A fast retrieval technique for large graph structures
• scientific article; zbMATH DE number 423663 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• Storing a sparse table

Cited in

(2)

• Fast insertion methods of a double-array structure
• A fast and compact technique of implementing transition tables for finite state automata

This page was built for publication: An efficient representation for implementing finite state machines based on the double-array

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