620 search results - page 68 / 124 » Algorithms and computations on cellular automata |
99
Voted
LICS
1996
IEEE
15 years 4 months ago
1996
IEEE
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
131
Voted
CONCUR
1997
Springer
15 years 4 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
117
Voted
TACAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
101
click to vote
JALC
2007
15 years 15 days ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
116
Voted
ICTAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...