Sciweavers

3750 search results - page 85 / 750
» Timed Automata Patterns
Sort
View
TPHOL
2008
IEEE
14 years 5 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy
PLANX
2008
14 years 2 days ago
Complexity of Earliest Query Answering with Streaming Tree Automata
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 ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
DLT
2008
13 years 11 months ago
On the Size Complexity of Rotating and Sweeping Automata
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...
Christos A. Kapoutsis, Richard Královic, To...
COLT
1998
Springer
14 years 2 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
ICALP
2010
Springer
14 years 18 days ago
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
Mikolaj Bojanczyk, Pawel Parys