3229 search results - page 41 / 646 » The Theory of Timed Automata |
CADE
2006
Springer
14 years 14 days ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
FOSSACS
2000
Springer
14 years 10 days ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
TCS
2008
13 years 8 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
LATA
2010
Springer
14 years 1 months 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...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
