Search in:

International Journal of Computer Mathematics Volume 16, 1984 - Issue 1

Submit an article Journal homepage

Views

CrossRef citations to date

Altmetric

Original Articles

Systolic trellis automatatFootnote†
This work was supported by Natural Scienceand Engineering Research Council of Canada grants A-7403 and A-1617. Most of the work was done while the second and third author were visiting the Computer Science Department of the University of Waterloo.

K. Culik II Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

J. Gruska Computing Research Center, Bratislava, Czechoslovakia

A. Salomaa Mathematics Department, University of Turku, Turku, Finland

Pages 3-22 | Received 01 Oct 1983, Published online: 20 Mar 2007

Cite this article
https://doi.org/10.1080/00207168408803421

References
Citations
Metrics
Reprints & Permissions

Citations (37)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Karel Culik$suffix/text()$suffix/text() & Sheng Yu. (1987) Fault-tolerant schemes for some systolic systems . International Journal of Computer Mathematics 22:1, pages 13-42.
Read now

Articles from other publishers (36)

Alexander Okhotin, Maria Radionova & Elizaveta Sazhneva. (2024) GF(2)-operations on basic families of formal languages. Theoretical Computer Science 995, pages 114489.
Crossref

Véronique Terrier. (2017) Recognition of poly-slender context-free languages by trellis automata. Theoretical Computer Science 692, pages 1-24.
Crossref

Qirun Zhang & Zhendong Su. (2017) Context-sensitive data-dependence analysis via linear conjunctive language reachability. ACM SIGPLAN Notices 52:1, pages 344-358.
Crossref

Qirun Zhang & Zhendong Su. (2017) Context-sensitive data-dependence analysis via linear conjunctive language reachability. Context-sensitive data-dependence analysis via linear conjunctive language reachability.

Véronique Terrier. 2017. Cellular Automata and Discrete Complex Systems. Cellular Automata and Discrete Complex Systems 176 186 .

Alexander Okhotin. (2016) Input-driven languages are linear conjunctive. Theoretical Computer Science 618, pages 52-71.
Crossref

Véronique Terrier. 2015. Cellular Automata and Discrete Complex Systems. Cellular Automata and Discrete Complex Systems 251 262 .

Mikhail Barash & Alexander Okhotin. 2014. LATIN 2014: Theoretical Informatics. LATIN 2014: Theoretical Informatics 190 201 .

Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Giovanni Pardini & Simone Tini. 2014. Computing with New Resources. Computing with New Resources 17 31 .

Tamar Aizikowitz & Michael Kaminski. (2013) Conjunctive grammars and alternating pushdown automata. Acta Informatica 50:3, pages 175-197.
Crossref

Artur Jeż & Alexander Okhotin. 2013. Developments in Language Theory. Developments in Language Theory 277 288 .

Alexander Okhotin. (2011) A simple P-complete problem and its language-theoretic representations. Theoretical Computer Science 412:1-2, pages 68-82.
Crossref

Alexander Okhotin. 2011. SOFSEM 2011: Theory and Practice of Computer Science. SOFSEM 2011: Theory and Practice of Computer Science 431 443 .

Artur Jeż & Alexander Okhotin. (2008) Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. Theory of Computing Systems 46:1, pages 27-58.
Crossref

Artur Jeż & Alexander Okhotin. 2007. Computer Science – Theory and Applications. Computer Science – Theory and Applications 168 181 .

Alexander Okhotin. (2004) On the number of nonterminals in linear conjunctive grammars. Theoretical Computer Science 320:2-3, pages 419-448.
Crossref

Thomas Buchholz, Andreas Klein & Martin Kutrib. 1998. Mathematical Foundations of Computer Science 1998. Mathematical Foundations of Computer Science 1998 807 815 .

Kamala Krithivasan & Meena Mahajan. (1995) Nondeterministic, probabilistic and alternating computations on cellular array models. Theoretical Computer Science 143:1, pages 23-49.
Crossref

Roland Vollmar & Thomas WorschRoland Vollmar & Thomas Worsch. 1995. Modelle der Parallelverarbeitung. Modelle der Parallelverarbeitung 109 144 .

. (2011) Publications of K. Culik. RAIRO - Theoretical Informatics and Applications 28:3-4, pages 425-430.
Crossref

Juraj Hromkovic, Jarkko Kari & Lila Kari. 1993. Mathematical Foundations of Computer Science 1993. Mathematical Foundations of Computer Science 1993 495 505 .

O.H. Ibarra, T. Jiang & H. Wang. (1992) String editing on a one-way linear array of finite-state machines. IEEE Transactions on Computers 41:1, pages 112-118.
Crossref

Oscar H. Ibarra, Tao Jiang & Hui Wang. (1991) Parallel parsing on a one-way linear array of finite-state machines. Theoretical Computer Science 85:1, pages 53-74.
Crossref

Jozef Gruska. (1990) Synthesis, structure and power of systolic computations. Theoretical Computer Science 71:1, pages 47-77.
Crossref

O.H. Ibarra & S.M. Sohn. (1990) On mapping systolic algorithms onto the hypercube. IEEE Transactions on Parallel and Distributed Systems 1:1, pages 48-63.
Crossref

Karel CulikIIII. (1989) Variations of the firing squad problem and applications. Information Processing Letters 30:3, pages 152-157.
Crossref

Jean Moulin Ollagnier. (2011) Sur quelques classes d’applications de $N^2$ dans les ensembles finis. RAIRO - Theoretical Informatics and Applications 23:4, pages 461-492.
Crossref

Oscar H. Ibarra, Tao Jiang & Hui Wang. 1989. Foundations of Software Technology and Theoretical Computer Science. Foundations of Software Technology and Theoretical Computer Science 291 300 .

Roland Vollmar. 1989. Parcella '88. Parcella '88 205 222 .

E. Fachini & M. Napoli. (1988) C-tree systolic automata. Theoretical Computer Science 56:2, pages 155-186.
Crossref

Jozef Gruska. 1988. Automata, Languages and Programming. Automata, Languages and Programming 254 270 .

K. CulikIIII, J. Gruska & A. Salomaa. (1986) Systolic trellis automata: Stability, decidability and complexity. Information and Control 71:3, pages 218-230.
Crossref

Sheng Yu. (1986) A property of real-time trellis automata. Discrete Applied Mathematics 15:1, pages 117-119.
Crossref

Ivan Korec. 1986. Mathematical Foundations of Computer Science 1986. Mathematical Foundations of Computer Science 1986 458 466 .

G. Rozenberg & A. SalomaaA. Černý & J. Gruska. 1986. The Book of L. The Book of L 45 61 .

Karel CulikIIII & Ivan Fris. (1985) Topological transformations as a tool in the design of systolic networks. Theoretical Computer Science 37, pages 183-216.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Share icon
Back to Top

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.

People also read
Recommended articles
Cited by

To cite this article:

Reference style: APA Chicago Harvard

Citation copied to clipboard

Reference styles above use APA (6th edition), Chicago (16th edition) & Harvard (10th edition)

Download citation

Download a citation file in RIS format that can be imported by citation management software including EndNote, ProCite, RefWorks and Reference Manager.

Choose format: RIS BibTex RefWorks Direct Export

Choose options: Citation Citation & abstract Citation & references

Systolic trellis automatatFootnote†
This work was supported by Natural Scienceand Engineering Research Council of Canada grants A-7403 and A-1617. Most of the work was done while the second and third author were visiting the Computer Science Department of the University of Waterloo.

Articles from other publishers (36)

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

Systolic trellis automatatFootnote†This work was supported by Natural Scienceand Engineering Research Council of Canada grants A-7403 and A-1617. Most of the work was done while the second and third author were visiting the Computer Science Department of the University of Waterloo.

Citations (37)

Read on this site (1)

Articles from other publishers (36)

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Systolic trellis automatatFootnote†
This work was supported by Natural Scienceand Engineering Research Council of Canada grants A-7403 and A-1617. Most of the work was done while the second and third author were visiting the Computer Science Department of the University of Waterloo.