665 search results - page 104 / 133 » The Theory of Hybrid Automata |
268
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
158
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
167
click to vote
ESORICS
2002
Springer
16 years 5 months ago
2002
Springer
We introduce the ISM approach, a framework for modeling and verifying reactive systems in a formal, even machine-checked, way. The framework has been developed for applications in ...
154
click to vote
LATA
2010
Springer
16 years 28 days ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
151
click to vote
LATA
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...