371 search results - page 34 / 75 » Pushdown Automata Simulator |
146
click to vote
RTA
2005
Springer
15 years 7 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
103
click to vote
AMAST
2006
Springer
15 years 5 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
149
Voted
PE
2011
Springer
14 years 8 months ago
2011
Springer
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
137
click to vote
HIS
2004
15 years 3 months ago
2004
In this paper, a new fuzzy clustering algorithm that uses cellular learning automata based evolutionary computing (CLA-EC) is proposed. The CLA-EC is a model obtained by combining...
102
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...