Systolic trellis automatata †
From MaRDI portal
Publication:3687722
DOI10.1080/00207168408803410zbMath0571.68041OpenAlexW4229969393MaRDI QIDQ3687722
Jozef Gruska, Karel II Culik, 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/00207168408803410
designsystolic trellis automatoncombinational circuitpipelininglanguage recognitionsystolic tree automatasystolic automata
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (28)
Some hierarchies for the communication complexity measures of cooperating grammar systems ⋮ A property of real-time trellis automata ⋮ Unnamed Item ⋮ Boolean grammars ⋮ Conjunctive grammars and alternating pushdown automata ⋮ Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ Input-driven languages are linear conjunctive ⋮ Relating the power of cellular arrays to their closure properties ⋮ Language classes defined by time-bounded relativised cellular automata ⋮ Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ Systolic Automata and P Systems ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A simple P-complete problem and its language-theoretic representations ⋮ Inductive definitions in logic versus programs of real-time cellular automata ⋮ On some open problems concerning the complexity of cellular arrays ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ Systolic automata for VLSI on balanced trees ⋮ Fault-tolerant schemes for some systolic systems ⋮ The complexity of systolic dissemination of information in interconnection networks ⋮ Nondeterministic, probabilistic and alternating computations on cellular array models ⋮ Unambiguous Boolean grammars ⋮ Unambiguous conjunctive grammars over a one-symbol alphabet ⋮ Sur quelques classes d’applications de $N^2$ dans les ensembles finis ⋮ Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth ⋮ Linear grammars with one-sided contexts and their automaton representation ⋮ Languages accepted by systolic \(Y\)-tree automata: Structural characterizations ⋮ Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata ⋮ Unresolved systems of language equations: expressive power and decision problems
Cites Work
This page was built for publication: Systolic trellis automatata †
