On real time one-way cellular array
From MaRDI portal
Publication:673792
DOI10.1016/0304-3975(94)00212-2zbMATH Open0873.68114OpenAlexW1971471851MaRDI QIDQ673792FDOQ673792
Authors: Véronique Terrier 
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
Recommendations
Cites Work
- On One-Way Cellular Arrays
- Variations of the firing squad problem and applications
- 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
- On real-time cellular automata and trellis automata
- Relating the power of cellular arrays to their closure properties
- Title not available (Why is that?)
Cited In (35)
- Languages not recognizable in real time by one-dimensional cellular automata
- On the number of nonterminals in linear conjunctive grammars
- A simple P-complete problem and its language-theoretic representations
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- Unambiguous Boolean grammars
- Language not recognizable in real time by one-way cellular automata
- Closure properties of cellular automata
- Fast one-way cellular automata.
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
- Constructible functions in cellular automata and their applications to hierarchy results
- Cellular automata with limited inter-cell bandwidth
- On the equivalence of linear conjunctive grammars and trellis automata
- Edit distance neighbourhoods of input-driven pushdown automata
- Hardest languages for conjunctive and Boolean grammars
- Real-time reversible one-way cellular automata
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- Pushdown cellular automata
- Quasi-realtime languages
- Recognition of poly-slender context-free languages by trellis automata
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Theory of cellular automata: a survey
- On hardest languages for one-dimensional cellular automata
- The Boolean closure of linear context-free languages
- Complexity of one-way cellular automata
- On One-Way Cellular Arrays
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages
- Boolean grammars
- Language equations
- Input-driven languages are linear conjunctive
- On hardest languages for one-dimensional cellular automata
- Linear grammars with one-sided contexts and their automaton representation
- Unambiguous conjunctive grammars over a one-symbol alphabet
- Non-deterministic cellular automata and languages
- Title not available (Why is that?)
- Low complexity classes of multidimensional cellular automata
This page was built for publication: On real time one-way cellular array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673792)
