On real time one-way cellular array
From MaRDI portal
Publication:673792
DOI10.1016/0304-3975(94)00212-2zbMath0873.68114OpenAlexW1971471851MaRDI QIDQ673792
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00212-2
Related Items (31)
Closure properties of cellular automata ⋮ Boolean grammars ⋮ Input-driven languages are linear conjunctive ⋮ Language not recognizable in real time by one-way cellular automata ⋮ Low complexity classes of multidimensional cellular automata ⋮ On the equivalence of linear conjunctive grammars and trellis automata ⋮ On the number of nonterminals in linear conjunctive grammars ⋮ Recognition of poly-slender context-free languages by trellis automata ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A simple P-complete problem and its language-theoretic representations ⋮ Fast one-way cellular automata. ⋮ Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ The Boolean closure of linear context-free languages ⋮ On hardest languages for one-dimensional cellular automata ⋮ Hardest languages for conjunctive and Boolean grammars ⋮ Unambiguous Boolean grammars ⋮ Unambiguous conjunctive grammars over a one-symbol alphabet ⋮ Languages not recognizable in real time by one-dimensional cellular automata ⋮ Cellular automata with limited inter-cell bandwidth ⋮ Theory of cellular automata: a survey ⋮ On hardest languages for one-dimensional cellular automata ⋮ Expressive power of \(\text{LL}(k)\) Boolean grammars ⋮ Constructible functions in cellular automata and their applications to hierarchy results ⋮ Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages ⋮ Edit distance neighbourhoods of input-driven pushdown automata ⋮ Language equations ⋮ Pushdown cellular automata ⋮ Complexity of One-Way Cellular Automata ⋮ Linear grammars with one-sided contexts and their automaton representation ⋮ Non-deterministic cellular automata and languages
Cites Work
- Unnamed Item
- On real-time cellular automata and trellis automata
- Relating the power of cellular arrays to their closure properties
- Variations of the firing squad problem and applications
- On One-Way Cellular Arrays
- One-way bounded cellular automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
This page was built for publication: On real time one-way cellular array
