An efficient representation for implementing finite state machines based on the double-array (Q5946284): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3136414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storing a sparse table / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4773298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065051 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast retrieval technique for large graph structures / rank | |||
Normal rank |
Revision as of 20:44, 3 June 2024
scientific article; zbMATH DE number 1658621
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient representation for implementing finite state machines based on the double-array |
scientific article; zbMATH DE number 1658621 |
Statements
An efficient representation for implementing finite state machines based on the double-array (English)
0 references
2 January 2002
0 references
double-array structure
0 references