3653 search results - page 385 / 731 » On Recognizable Timed Languages |
134
click to vote
EURODAC
1994
IEEE
15 years 11 months ago
1994
IEEE
We present a rigorous but transparent semantic de nition of VHDL'93 covering the complete signal behavior and time model including the various wait statements and signal assi...
166
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
162
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
164
click to vote
ECTEL
2007
Springer
15 years 10 months ago
2007
Springer
When a curriculum is proposed, it is important to verify at least three aspects: that the curriculum allows the achievement of the user's learning goals, that the curriculum i...
174
click to vote
CLIMA
2006
15 years 8 months ago
2006
This paper describes a team of agents that took part in the second CLIMA Contest. The team was implemented in a logic-based language for BDI agents and was run in a Java-based inte...