Systolic trellis automatata †
From MaRDI portal
Publication:3687722
DOI10.1080/00207168408803410zbMATH Open0571.68041OpenAlexW4229969393MaRDI QIDQ3687722FDOQ3687722
Authors: 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/00207168408803410
designcombinational circuitpipelininglanguage recognitionsystolic tree automatasystolic automatasystolic trellis automaton
Cites Work
Cited In (30)
- Title not available (Why is that?)
- A simple P-complete problem and its language-theoretic representations
- Relating the power of cellular arrays to their closure properties
- Unambiguous Boolean grammars
- Systolic automata for VLSI on balanced trees
- Characterizations and computational complexity of systolic trellis automata
- Systolic automata and P systems
- A property of real-time trellis automata
- Power of interconnections and of nondeterminism in regularY-tree systolic automata
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids
- Unresolved systems of language equations: expressive power and decision problems
- On some open problems concerning the complexity of cellular arrays
- Conjunctive grammars and alternating pushdown automata
- Sur quelques classes d’applications de $N^2$ dans les ensembles finis
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
- Some hierarchies for the communication complexity measures of cooperating grammar systems
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages
- Boolean grammars
- The complexity of systolic dissemination of information in interconnection networks
- Fault-tolerant schemes for some systolic systems
- Title not available (Why is that?)
- Language classes defined by time-bounded relativised cellular automata
- Input-driven languages are linear conjunctive
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- Linear grammars with one-sided contexts and their automaton representation
- Unambiguous conjunctive grammars over a one-symbol alphabet
- Inductive definitions in logic versus programs of real-time cellular automata
- Nondeterministic, probabilistic and alternating computations on cellular array models
This page was built for publication: Systolic trellis automatata †
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687722)
