finite automata implementations considering cpu cache

Clicks: 93
ID: 201597
2007
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #152 of 188 articles by views in the journal of nutrition

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 188 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
The finite automata are mathematical models for finite state systems. More general finite automaton is the nondeterministic finite automaton (NFA) that cannot be directly used. It is usually transformed to the deterministic finite automaton (DFA) that then runs in time O(n), where n is the size of the input text. We present two main approaches to practical implementation of DFA considering CPU cache. The first approach (represented by Table Driven and Hard Coded implementations) is suitable forautomata being run very frequently, typically having cycles. The other approach is suitable for a collection of automata from which various automata are retrieved and then run. This second kind of automata are expected to be cycle-free. 
Reference Key
holub2007actafinite Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;J. Holub
Journal the journal of nutrition
Year 2007
DOI
DOI not found
URL
https://ojs.cvut.cz/ojs/index.php/ap/article/view/1008
Keywords
civil engineering (general)

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.