On real-time cellular automata and trellis automata
From MaRDI portal
Publication:790615
DOI10.1007/BF00264617zbMATH Open0534.68039OpenAlexW2078011493MaRDI QIDQ790615FDOQ790615
Authors: Christian Choffrut, Karel II Culik 
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00264617
Recommendations
Cited In (63)
- Languages not recognizable in real time by one-dimensional cellular automata
- Synthesis, structure and power of systolic computations
- On the number of nonterminals in linear conjunctive grammars
- On real time one-way cellular array
- One-dimensional pattern generation by cellular automata
- Relating the power of cellular arrays to their closure properties
- 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.
- Real time recognition with cellular automata : a meaningful example
- Bulking I: An abstract theory of bulking
- The hardest linear conjunctive language
- Linear speed-up for cellular automata synchronizers and applications
- A property of real-time trellis automata
- Variations of the firing squad problem and applications
- Constructible functions in cellular automata and their applications to hierarchy results
- Complexity of One-Way Cellular Automata
- A universal cellular automaton in quasi-linear time and its S-m-n form
- On the equivalence of linear conjunctive grammars and trellis automata
- Optimal simulation of tree arrays by linear arrays
- On iterative and cellular tree arrays
- Grids and universal computations on one-dimensional cellular automata
- Iterative tree arrays with logarithmic depth†
- Self-verifying Cellular Automata
- Pushdown cellular automata
- Recognition of poly-slender context-free languages by trellis automata
- Theory of cellular automata: a survey
- One-way cellular automata on Cayley graphs
- Signals in one-dimensional cellular automata
- Efficient unidimensional universal cellular automaton
- On hardest languages for one-dimensional cellular automata
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids
- Computations on one-dimensional cellular automata
- Achieving universal computations on one-dimensional cellular automata
- Different time solutions for the firing squad synchronization problem on basic grid networks
- A survey of two-dimensional automata theory
- Two-dimensional cellular automata and deterministic on-line tessalation automata
- Title not available (Why is that?)
- Cellular automata with sparse communication
- Boolean grammars
- Some results on time-varying and relativised cellular automata*
- The complexity of systolic dissemination of information in interconnection networks
- Fault-tolerant schemes for some systolic systems
- Title not available (Why is that?)
- One-dimensional pattern generation by cellular automata
- Language classes defined by time-bounded relativised cellular automata
- Real-time, pseudo real-time, and linear-time ITA
- A linear speed-up theorem for cellular automata
- Iterative tree automata
- Superposable Trellis Automata
- Title not available (Why is that?)
- Non-deterministic cellular automata and languages
- Low complexity classes of multidimensional cellular automata
- Topological transformations as a tool in the design of systolic networks
- Nondeterministic, probabilistic and alternating computations on cellular array models
- Real-Time Reversible One-Way Cellular Automata
- On time reduction and simulation in cellular spaces
- Hierarchies and undecidability results for iterative arrays with sparse communication
- On some open problems concerning the complexity of cellular arrays
- Real-Time Prime Generators Implemented on Small-State Cellular Automata
- On hardest languages for one-dimensional cellular automata
- Inductive definitions in logic versus programs of real-time cellular automata
This page was built for publication: On real-time cellular automata and trellis automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790615)
