665 search results - page 96 / 133 » The Theory of Hybrid Automata |
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
SBIA
2004
Springer
14 years 29 days ago
2004
Springer
This paper presents an overview of current work on the recognition of sign language and a prototype of a simple editor for a small subset of the Brazilian Sign Language, LIBRAS. Ha...
LATA
2010
Springer
14 years 22 days ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
STACS
2001
Springer
14 years 1 days ago
2001
Springer
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
SIGCSE
1994
ACM
13 years 11 months ago
1994
ACM
This paper describes instructional tools, LLparse and LRparse, for visualizing and interacting with small examples of LL and LR parsing. These tools can be used to understand the ...