Systolic trellis automatat†

From MaRDI portal
Publication:3687723

DOI10.1080/00207168408803421zbMath0571.68042OpenAlexW2041694802MaRDI QIDQ3687723

Karel II Culik, Jozef Gruska, Arto Salomaa

Publication date: 1984

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168408803421




Related Items (27)

A property of real-time trellis automataUnnamed ItemSome decision problems for parallel communicating grammar systemsInput-driven languages are linear conjunctiveC-tree systolic automataOn the equivalence of linear conjunctive grammars and trellis automataVariations of the firing squad problem and applicationsOn the number of nonterminals in linear conjunctive grammarsRecognition of poly-slender context-free languages by trellis automataSystolic Automata and P SystemsA simple P-complete problem and its language-theoretic representations\(\mathrm{GF}(2)\)-operations on basic families of formal languagesSynthesis, structure and power of systolic computationsFault-tolerant schemes for some systolic systemsParallel parsing on a one-way linear array of finite-state machinesNondeterministic, probabilistic and alternating computations on cellular array modelsThe impact of the number of cooperating grammars on the generative powerComputational completeness of equations over sets of natural numbersUnnamed ItemConjunctive grammars over a unary alphabet: Undecidability and unbounded growthComparing Linear Conjunctive Languages to Subfamilies of the Context-Free LanguagesUnnamed ItemLanguage equationsLinear grammars with one-sided contexts and their automaton representationCharacterizations and computational complexity of systolic trellis automataOn a family of L languages resulting from systolic tree automataTopological transformations as a tool in the design of systolic networks



Cites Work


This page was built for publication: Systolic trellis automatat†