54 search results - page 9 / 11 » Deterministic Automata on Unranked Trees |
WIA
2007
Springer
14 years 1 months ago
2007
Springer
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
PLANX
2008
13 years 8 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 ...
SSPR
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
CAV
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non...