Sciweavers

171 search results - page 4 / 35
» On the Power of Tree-Walking Automata
Sort
View
80
Voted
FOCS
1997
IEEE
15 years 2 months ago
On the Power of Quantum Finite State Automata
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
Attila Kondacs, John Watrous
102
Voted
PODS
2002
ACM
132views Database» more  PODS 2002»
15 years 10 months ago
Distributed Computation of Web Queries Using Automata
We introduce and investigate a distributed computation model for querying the Web. Web queries are computed by interacting automata running at different nodes in the Web. The auto...
Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bus...
106
Voted
ADL
2000
Springer
225views Digital Library» more  ADL 2000»
15 years 2 months ago
Using Regular Tree Automata as XML Schemas
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
Boris Chidlovskii
104
Voted
BIRTHDAY
2012
Springer
13 years 6 months ago
Cryptography with Asynchronous Logic Automata
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. ...
Peter Schmidt-Nielsen, Kailiang Chen, Jonathan Bac...
NC
2010
159views Neural Networks» more  NC 2010»
14 years 8 months ago
Automata and processes on multisets of communicating objects
Abstract. Inspired by P systems initiated by Gheorghe P˜aun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of fini...
Linmin Yang, Yong Wang, Zhe Dang