81 search results - page 8 / 17 » A Formalisation of Finite Automata Using Hereditarily Finite... |
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
ICDT
2003
ACM
15 years 2 months ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
68
Voted
FORTE
2004
14 years 11 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
SIGCSE
1994
ACM
15 years 1 months ago
1994
ACM
This paper describes instructional tools, LLparse and LRparse, for visualizing and interacting with small examples of LL and LR parsing. These tools can be used to understand the ...
FPL
2008
Springer
14 years 11 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...