Gheorghe Păun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Gheorghe Păun has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jürgen Dassow
Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, PSF 4120, 39016 Magdeburg, Germany
5 shared publications - Carlos Martín-Vide
Rovira i Virgili University
3 shared publications - Grzegorz Rozenberg
Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands
3 shared publications - Arto Salomaa
University of Turku
2 shared publications - Erzsébet Csuhaj-Varjú
Hungarian Academy of Sciences
2 shared publications - Sheng Yu
Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7
2 shared publications
Latest Publications
- Open Access
- 25 November 2008
- Published by EHU Press in THEORIA. An International Journal for Theory, History and Foundations of Science
- Vol. 18 (1) , 71-84
Recent Computability Models Inspired from Biology: DNA and Membrane Computing
We briefly present two areas of natural computing, vividly investigated in the recent years: DNA computing and membrane computing. Both of them have the roots in cellular biology and are rather developed at the theoretical level (new concepts, models, paradigms of computer science, with mathematical and epistemological significance have been considered in this framework), but both areas are still looking for implementations of a practical interest.
- 25 November 2008
- Published by EHU Press in THEORIA. An International Journal for Theory, History and Foundations of Science
- Vol. 18 (1) , 71-84
Open AccessRecent Computability Models Inspired from Biology: DNA and Membrane Computing
We briefly present two areas of natural computing, vividly investigated in the recent years: DNA computing and membrane computing. Both of them have the roots in cellular biology and are rather developed at the theoretical level (new concepts, models, paradigms of computer science, with mathematical and epistemological significance have been considered in this framework), but both areas are still looking for implementations of a practical interest.
- Open Access
- 15 June 2004
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 38 (3) , 257-267
On differentiation functions, structure functions, and related languages of context-free grammars
We introduce the notion of a differentiation function of a context-free grammar which gives the number of terminal words that can be derived in a certain number of steps. A grammar is called narrow (or k-narrow) iff its differentiation function is bounded by a constant (by k). We present the basic properties of differentiation functions, especially we relate them to structure function of context-free languages and narrow grammars to slender languages. We discuss the decidability of the equivalence of grammars with respect to the differentiation function and structure function and prove the decidability of the k-narrowness of context-free grammars. Furthermore, we introduce languages representing the graph of the differentiation and structure function and relate these languages to those of the Chomsky hierarchy.
- 15 June 2004
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 38 (3) , 257-267
Open AccessOn differentiation functions, structure functions, and related languages of context-free grammars
We introduce the notion of a differentiation function of a context-free grammar which gives the number of terminal words that can be derived in a certain number of steps. A grammar is called narrow (or k-narrow) iff its differentiation function is bounded by a constant (by k). We present the basic properties of differentiation functions, especially we relate them to structure function of context-free languages and narrow grammars to slender languages. We discuss the decidability of the equivalence of grammars with respect to the differentiation function and structure function and prove the decidability of the k-narrowness of context-free grammars. Furthermore, we introduce languages representing the graph of the differentiation and structure function and relate these languages to those of the Chomsky hierarchy.
- 1 January 2004
- Published by Springer Nature
- p. 175-192
P Systems with Symport/Antiport Rules. A Survey
- 1 December 2003
- Published by Springer Nature in Natural Computing
- Vol. 2 (4) , 337-348
Unexpected universality results for three classes of P systems with symport/antiport
- 1 December 2003
- Published by Springer Nature in Natural Computing
- Vol. 2 (4) , 337-348
Unexpected universality results for three classes of P systems with symport/antiport
- 18 April 2003
- Published by Elsevier in Theoretical Computer Science
- Vol. 299 (1-3) , 785-794
PC grammar systems with five context-free components generate all recursively enumerable languages
- 18 April 2003
- Published by Elsevier in Theoretical Computer Science
- Vol. 299 (1-3) , 785-794
PC grammar systems with five context-free components generate all recursively enumerable languages
- 14 February 2002
- Published by Springer Nature
- p. 325-353
Rewriting P Systems with Conditional Communication
- 14 February 2002
- Published by Springer Nature
- p. 325-353
Rewriting P Systems with Conditional Communication
- 1 January 2002
- Published by Springer Nature
- p. 367-397
(Attempts to Get) Back to Reality
- 1 January 2002
- Published by Springer Nature
- p. 329-366
Further Technical Results
- 1 January 2002
- Published by Springer Nature
- p. 271-328
Trading Space for Time