1000 search results - page 34 / 200 » Dependency Tree Automata |
118
click to vote
RTSS
1998
IEEE
15 years 6 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
138
Voted
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
91
Voted
NAACL
2004
15 years 3 months ago
2004
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for grante...
112
click to vote
STACS
1999
Springer
15 years 6 months ago
1999
Springer
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
104
Voted
FOIKS
2010
Springer
15 years 5 months ago
2010
Springer
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...