732 search results - page 72 / 147 » Axiomatising timed automata |
PLANX
2008
13 years 9 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
DLT
2008
13 years 8 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
ALT
2010
Springer
13 years 9 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
CIT
2006
Springer
13 years 11 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...