Sciweavers

1000 search results - page 45 / 200
» Dependency Tree Automata
Sort
View
FORMATS
2008
Springer
15 years 1 months ago
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
Jirí Srba
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 6 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
99
Voted
ECAI
2006
Springer
15 years 3 months ago
Ensembles of Grafted Trees
Grafted trees are trees that are constructed using two methods. The first method creates an initial tree, while the second method is used to complete the tree. In this work, the fi...
Juan José Rodríguez, Jesús Ma...
SIGCSE
1997
ACM
158views Education» more  SIGCSE 1997»
15 years 4 months ago
A collection of tools for making automata theory and formal languages come alive
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider...
RTA
2007
Springer
15 years 6 months ago
Proving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp