On real-time cellular automata and trellis automata
From MaRDI portal
Publication:790615
DOI10.1007/BF00264617zbMath0534.68039MaRDI QIDQ790615
Christian Choffrut, Karel II Culik
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
On time reduction and simulation in cellular spaces, Language classes defined by time-bounded relativised cellular automata, The complexity of systolic dissemination of information in interconnection networks, On the equivalence of linear conjunctive grammars and trellis automata, Achieving Universal Computations on One-Dimensional Cellular Automata, Real time recognition with cellular automata : a meaningful example, Constructible functions in cellular automata and their applications to hierarchy results, Bulking I: An abstract theory of bulking, On the number of nonterminals in linear conjunctive grammars, Nondeterministic, probabilistic and alternating computations on cellular array models, On real time one-way cellular array, Iterative tree automata, Closure properties of cellular automata, Low complexity classes of multidimensional cellular automata, Synthesis, structure and power of systolic computations, Languages not recognizable in real time by one-dimensional cellular automata, The hardest linear conjunctive language, Topological transformations as a tool in the design of systolic networks, A property of real-time trellis automata, Real-time, pseudo real-time, and linear-time ITA, Relating the power of cellular arrays to their closure properties, Variations of the firing squad problem and applications, Optimal simulation of tree arrays by linear arrays, On iterative and cellular tree arrays, A linear speed-up theorem for cellular automata, Pushdown cellular automata, Signals in one-dimensional cellular automata, A universal cellular automaton in quasi-linear time and its S-m-n form, One-way cellular automata on Cayley graphs, Language not recognizable in real time by one-way cellular automata, Linear speed-up for cellular automata synchronizers and applications, Two-dimensional cellular automata and deterministic on-line tessalation automata, Fast one-way cellular automata., Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars., Theory of cellular automata: a survey, Computations on one-dimensional cellular automata, Boolean grammars, Cellular automata with sparse communication, A survey of two-dimensional automata theory, Non-deterministic cellular automata and languages, Different time solutions for the firing squad synchronization problem on basic grid networks, Iterative tree arrays with logarithmic depth†, Fault-tolerant schemes for some systolic systems, Some results on time-varying and relativised cellular automata*
