Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

On the history of computer science, computer engineering, and computer technology development in Slovakia

J. Dujnic, N. Fristacky, L. Molnar, I. Plander and B. Rovan
IEEE Annals of the History of Computing 21 (3) 38 (1999)
DOI: 10.1109/85.778981
See this article

Operations and language generating devices suggested by the genome evolution

Jürgen Dassow, Victor Mitrana and Arto Salomaa
Theoretical Computer Science 270 (1-2) 701 (2002)
DOI: 10.1016/S0304-3975(01)00096-2
See this article

Iterated sequential transducers as language generating devices

Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca and Carlos Martín-Vide
Theoretical Computer Science 369 (1-3) 67 (2006)
DOI: 10.1016/j.tcs.2006.07.059
See this article

Cancellation in context-free languages: enrichment by reduction

M Jantzen and H Petersen
Theoretical Computer Science 127 (1) 149 (1994)
DOI: 10.1016/0304-3975(94)90104-X
See this article

Unconventional Computation and Natural Computation

Henning Fernau, Lakshmanan Kuppusamy and Sergey Verlan
Lecture Notes in Computer Science, Unconventional Computation and Natural Computation 10240 182 (2017)
DOI: 10.1007/978-3-319-58187-3_14
See this article

Phrase-Structure Grammars: Normal Forms and Reduction

Zbyněk Křivka, Alexander Meduna and Petr Zemek
The Computer Journal 59 (8) 1180 (2016)
DOI: 10.1093/comjnl/bxw001
See this article

DNA computing based on splicing: universality results

Gheorghe Păun
Theoretical Computer Science 231 (2) 275 (2000)
DOI: 10.1016/S0304-3975(99)00104-8
See this article

One-sided random context grammars with a limited number of right random context rules

Alexander Meduna and Petr Zemek
Theoretical Computer Science 516 127 (2014)
DOI: 10.1016/j.tcs.2013.11.009
See this article

On the computational completeness of graph-controlled insertion–deletion systems with binary sizes

Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman
Theoretical Computer Science 682 100 (2017)
DOI: 10.1016/j.tcs.2017.01.019
See this article

Descriptional complexity of multi-parallel grammars

Tomáš Masopust
Information Processing Letters 108 (2) 68 (2008)
DOI: 10.1016/j.ipl.2008.04.002
See this article

CD GRAMMAR SYSTEMS WITH REGULAR START CONDITIONS

RUDOLF FREUND and MARION OSWALD
International Journal of Foundations of Computer Science 19 (04) 767 (2008)
DOI: 10.1142/S0129054108005942
See this article

Nonterminal complexity of one-sided random context grammars

Alexander Meduna and Petr Zemek
Acta Informatica 49 (2) 55 (2012)
DOI: 10.1007/s00236-012-0150-6
See this article

Formal properties of PA-matching

Satoshi Kobayashi, Victor Mitrana, Gheorghe Păun and Grzegorz Rozenberg
Theoretical Computer Science 262 (1-2) 117 (2001)
DOI: 10.1016/S0304-3975(00)00185-7
See this article

Context-free evolutionary grammars and the structural language of nucleic acids

Jürgen Dassow, Victor Mitrana and Arto Salomaa
Biosystems 43 (3) 169 (1997)
DOI: 10.1016/S0303-2647(97)00036-1
See this article

A note on the descriptional complexity of semi-conditional grammars

Fumiya Okubo
Information Processing Letters 110 (1) 36 (2009)
DOI: 10.1016/j.ipl.2009.10.002
See this article

Implementation and Application of Automata

Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman
Lecture Notes in Computer Science, Implementation and Application of Automata 10329 89 (2017)
DOI: 10.1007/978-3-319-60134-2_8
See this article