371 search results - page 21 / 75 » Pushdown Automata Simulator |
106
click to vote
CORR
2000
Springer
15 years 1 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
139
click to vote
FORMATS
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
141
Voted
EUROGP
2003
Springer
15 years 7 months ago
2003
Springer
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers ...
125
click to vote
CAI
2009
Springer
15 years 8 months ago
2009
Springer
Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring. The two type...
108
Voted
JDCTA
2010
14 years 8 months ago
2010
In this paper we model the growth of living plants in a discrete approach, the graph automata based plant model representing each metamer of the plant as node of the automata. The...