AbstractWe define a relation of equivalence on input words of one-way cellular automata. Then by counting arguments we show that the language {uvu: u, v ϵ {0, 1}∗, ¦u¦> 1} is not recognizable in real time on an OCA
Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved ...
In this article we will focus on a famous open question about algorithmiccomplexity classes on one d...
AbstractConcerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have...
AbstractWe define a relation of equivalence on input words of one-way cellular automata. Then by cou...
AbstractSpace-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion...
Pattern recognition by parallel devices is investigated by studying the formal language recognition ...
AbstractSpace-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion...
AbstractWe present a condition on the languages to be recognizable in real time on a one-way cellula...
AbstractA stack augmented generalization of cellular automata, the pushdown cellular automata, are i...
AbstractConcerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have...
This paper studies a restriction of one-dimensional bounded cellular automata in which information i...
We study the influence of the dimension of cellular automata (CA) for real time language recognition...
AbstractThere are many fundamental open problems concerning cellular arrays (CA's). For example:(1)I...
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated....
Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved ...
Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved ...
In this article we will focus on a famous open question about algorithmiccomplexity classes on one d...
AbstractConcerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have...
AbstractWe define a relation of equivalence on input words of one-way cellular automata. Then by cou...
AbstractSpace-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion...
Pattern recognition by parallel devices is investigated by studying the formal language recognition ...
AbstractSpace-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion...
AbstractWe present a condition on the languages to be recognizable in real time on a one-way cellula...
AbstractA stack augmented generalization of cellular automata, the pushdown cellular automata, are i...
AbstractConcerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have...
This paper studies a restriction of one-dimensional bounded cellular automata in which information i...
We study the influence of the dimension of cellular automata (CA) for real time language recognition...
AbstractThere are many fundamental open problems concerning cellular arrays (CA's). For example:(1)I...
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated....
Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved ...
Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved ...
In this article we will focus on a famous open question about algorithmiccomplexity classes on one d...
AbstractConcerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have...
DOI
Add to ORKG