Sciweavers

3229 search results - page 109 / 646
» The Theory of Timed Automata
Sort
View
DLT
2008
15 years 7 months ago
On the Size Complexity of Rotating and Sweeping Automata
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
Christos A. Kapoutsis, Richard Královic, To...
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
16 years 17 days ago
Towards the coevolution of cellular automata controllers for chemical computing with the B-Z reaction
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...
IJCNN
2000
IEEE
15 years 10 months ago
Exploiting the Selfish Gene Algorithm for Evolving Cellular Automata
This paper shows an application in the field of Electronic CAD of the Selfish Gene algorithm, an evolutionary algorithm based on a recent interpretation of the Darwinian theory. Te...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...
JUCS
2002
110views more  JUCS 2002»
15 years 6 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa
ICALP
2010
Springer
15 years 8 months ago
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
Mikolaj Bojanczyk, Pawel Parys