171 search results - page 19 / 35 » On the Power of Tree-Walking Automata |
ACRI
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
COLT
1995
Springer
14 years 1 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
IANDC
2006
13 years 9 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
LPAR
2005
Springer
14 years 3 months ago
2005
Springer
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...