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

DOI10.1016/S0020-0255(00)00061-XzbMath0981.68107OpenAlexW2012835847MaRDI QIDQ5946284

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

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

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

Cites Work

• A fast retrieval technique for large graph structures
• Storing a sparse table
• Unnamed Item
• Unnamed Item
• Unnamed Item

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