Erzsébet Csuhaj-Varjú

According to our database1, Erzsébet Csuhaj-Varjú
  • authored at least 126 papers between 1986 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Further results on generalised communicating P systems.
Theor. Comput. Sci., 2017

Watson-Crick T0L Systems and Red-Green Register Machines.
Fundam. Inform., 2017

Computationally Complete Generalized Communicating P Systems with Three Cells.
Proceedings of the Membrane Computing, 2017

Bi-simulation Between P Colonies and P Systems with Multi-stable Catalysts.
Proceedings of the Membrane Computing, 2017

APCol Systems with Teams.
Proceedings of the Membrane Computing, 2017

2016
A class of restricted P colonies with string environment.
Natural Computing, 2016

String Assembly in Networks of Evolutionary Processors.
Journal of Automata, Languages and Combinatorics, 2016

2015
Spatially Localised Membrane Systems.
Fundam. Inform., 2015

Dynamically Changing Environment for Generalized Communicating P Systems.
Proceedings of the Membrane Computing, 2015

A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

2014
P Automata with Restricted Power.
Int. J. Found. Comput. Sci., 2014

P Colonies Processing Strings.
Fundam. Inform., 2014

Red-Green P Automata.
Proceedings of the Membrane Computing, 2014

2013
Computability in Europe 2009.
J. Log. Comput., 2013

P and DP Automata: Unconventional versus Classical Automata.
Int. J. Found. Comput. Sci., 2013

On the power of permitting features in cooperating context-free array grammar systems.
Discrete Applied Mathematics, 2013

On the Power of P Automata.
Proceedings of the Unconventional Computation and Natural Computation, 2013

P Automata: Automata-like constructs modeling complex natural systems.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

On Counter Machines versus dP Automata.
Proceedings of the Membrane Computing, 2013

2012
P Systems Controlled by General Topologies.
Proceedings of the Unconventional Computation and Natural Computation, 2012

P and dP Automata: Unconventional versus Classical Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
On generalized communicating P systems with minimal interaction rules.
Theor. Comput. Sci., 2011

Editorial: Computing with biomolecules.
Natural Computing, 2011

Pc Grammar Systems with Clusters of Components.
Int. J. Found. Comput. Sci., 2011

Blackhole Pushdown Automata.
Fundam. Inform., 2011

Expanding Formal Language and Automata Theory: Bio-inspired Computational Models.
ERCIM News, 2011

Finite dP Automata versus Multi-head Finite Automata.
Proceedings of the Membrane Computing, 2011

On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

CD Grammar Systems: Competence and Confidence.
Proceedings of the Computation, 2011

Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence.
Proceedings of the Computation, 2011

On Two Models in Bio-Inspired Computing: Membrane Systems and Networks of Evolutionary Processors.
Proceedings of the Biology, Computation and Linguistics - New Interdisciplinary Paradigms, 2011

2010
Preface.
Theor. Comput. Sci., 2010

P automata.
Scholarpedia, 2010

On the Descriptional Complexity of Context-Free Non-returning PC Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2010

Scattered context grammars generate any recursively enumerable language with two nonterminals.
Inf. Process. Lett., 2010

Preface.
Int. J. Found. Comput. Sci., 2010

Variants of Competence-Based Derivations in CD Grammar Systems.
Int. J. Found. Comput. Sci., 2010

Blackhole State-Controlled Regulated Pushdown Automata.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

On Generalized Communicating P Systems with One Symbol.
Proceedings of the Membrane Computing, 2010

2009
On the size of computationally complete hybrid networks of evolutionary processors.
Theor. Comput. Sci., 2009

Dynamically formed Clusters of Agents in Eco-Grammar Systems.
Int. J. Found. Comput. Sci., 2009

On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

P Automata: Concepts, Results, and New Aspects.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

2008
(Mem)brane automata.
Theor. Comput. Sci., 2008

On length-separating test tube systems.
Natural Computing, 2008

Preface.
Int. J. Found. Comput. Sci., 2008

Tissue-Like P Systems with Dynamically Emerging Requests.
Int. J. Found. Comput. Sci., 2008

Editing Configurations of P Systems.
Fundam. Inform., 2008

Peer-to-Peer Networks: A Language Theoretic Approach.
Computing and Informatics, 2008

About Universal Hybrid Networks of Evolutionary Processors of Small Size.
Proceedings of the Language and Automata Theory and Applications, 2008

Some New Modes of Competence-Based Derivations in CD Grammar Systems.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven Nodes.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

P Automata: Membrane Systems as Acceptors.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Self-assembly of strings and languages.
Theor. Comput. Sci., 2007

On small universal antiport P systems.
Theor. Comput. Sci., 2007

On Competence in CD Grammar Systems with Parallel Rewriting.
Int. J. Found. Comput. Sci., 2007

Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems.
Fundam. Inform., 2007

P Systems with String Objects and with Communication by Request.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

On a Variant of Parallel Communicating Grammar Systems with Communication by Command.
Proceedings of the Formal Models, 2007

2006
On the Computational Complexity of P Automata.
Natural Computing, 2006

Computing with Cells in Environment: P Colonies.
Multiple-Valued Logic and Soft Computing, 2006

CD grammar systems with competence based entry conditions in their cooperation protocols.
Int. J. Comput. Math., 2006

On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra.
Fundam. Inform., 2006

P Colonies with a Bounded Number of Cells and Programs.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Modeling Dynamical Parallelism in Bio-systems.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Length-Separating Test Tube Systems.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005
On the power and size of extended gemmating P systems.
Soft Comput., 2005

A remark on evolutionary systems.
Discrete Applied Mathematics, 2005

Hybrid networks of evolutionary processors are computationally complete.
Acta Inf., 2005

2004
Teams of pushdown automata.
Int. J. Comput. Math., 2004

Reducing the Size of Extended Gemmating Systems.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

P Automata.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

On the Computational Complexity of P Automata.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

On Competence in CD Grammar Systems.
Proceedings of the Developments in Language Theory, 2004

The Power of Networks of Watson-Crick D0L Systems.
Proceedings of the Aspects of Molecular Computing, 2004

On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems.
Proceedings of the Theory Is Forever, 2004

Networks of Standard Watson-Crick D0 L Systems with Incomplete Information Communication.
Proceedings of the Theory Is Forever, 2004

2003
PC grammar systems with five context-free components generate all recursively enumerable languages.
Theor. Comput. Sci., 2003

Power and size of extended Watson-Crick L systems.
Theor. Comput. Sci., 2003

From Watson-Crick L systems to Darwinian P systems.
Natural Computing, 2003

Teams of Pushdown Automata.
Proceedings of the Perspectives of Systems Informatics, 2003

Distributed Pushdown Automata Systems: Computational Power.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Parallel communicating grammar systems with bounded resources.
Theor. Comput. Sci., 2002

On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2002

Parallel Communicating Grammar Systems with Incomplete Information Communication.
Grammars, 2002

P Automata or Purely Communicating Accepting P Systems.
Proceedings of the Membrane Computing, International Workshop, 2002

Descriptional Complexity Issues in Grammar Systems.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

Parallel Communicating Finite Transducer Systems.
Proceedings of the Computational Linguistics in the Netherlands 2002, 2002

2001
On context-free parallel communicating grammar systems: synchronization, communication, and normal forms.
Theor. Comput. Sci., 2001

Parallel Communicating Grammar Systems with Incomplete Information Communication.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

On the Number of Rules in Components of Cooperating Distributed Grammar Systems with Probabilities.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

On size complexity of context-free returning parallel communicating grammar systems.
Proceedings of the Where Mathematics, 2001

Networks of Language Processors: Parallel Communicating Systems.
Current Trends in Theoretical Computer Science, 2001

Networks of Language Processors.
Current Trends in Theoretical Computer Science, 2001

2000
Parallel Communicating Grammar Systems with Bounded Resources: Results, Techniques, Open Problems.
Journal of Automata, Languages and Combinatorics, 2000

Parallel Communicating Pushdown Automata Systems.
Int. J. Found. Comput. Sci., 2000

Dynamical Teams in Eco-Grammar Systems.
Fundam. Inform., 2000

Evolutionary Systems: A Language Generating Device Inspired by Evolving Communities of Cells.
Acta Inf., 2000

Multiset Automata.
Proceedings of the Multiset Processing, 2000

Networks of Watson-Crick D0L Systems.
Proceedings of the International Colloquium on Words, 2000

1999
On the Computational Completeness of Context-Free Parallel Communicating Grammar Systems.
Theor. Comput. Sci., 1999

Pragmatics and Eco-Rewriting Systems.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

CD Grammar Systems Versus L Systems.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

1998
Team Behaviour in Eco-Grammar Systems.
Theor. Comput. Sci., 1998

Networks of Language Processors: Parallel Communicating Systems.
Bulletin of the EATCS, 1998

Cultural Eco-Grammar Systems: A Multi-Agent System for Cultural Change.
Proceedings of the Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, 1998

Networks of Language Processors: Distributed Communicating Architectures in Grammar Systems.
Proceedings of the Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, 1998

1997
Networks of Language Processors.
Bulletin of the EATCS, 1997

Eco-Grammar Systems: A Grammatical Framework for Studying Life-Like Interaction.
Artificial Life, 1997

Networks of Parallel Language Processors.
Proceedings of the New Trends in Formal Languages, 1997

1996
Grammar Systems with WAvE-like Communication.
Computers and Artificial Intelligence, 1996

Test Tube Distributed Systems Based on Splicing.
Computers and Artificial Intelligence, 1996

Grammar Systems: Recent Results and Perspectives (Foreword).
Acta Cybern., 1996

On Competence and Completeness in CD Grammar Systems.
Acta Cybern., 1996

1995
Conditional Tabled Eco-Grammar Systems.
J. UCS, 1995

1994
Languages of Colonies.
Theor. Comput. Sci., 1994

Grammars without context conditions.
Bulletin of the EATCS, 1994

Cooperating Grammars' Systems: Power and Parameters.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Descriptional Complexity of Context-Free Grammar Forms.
Theor. Comput. Sci., 1993

Dynamically controlled cooperating/distributed grammar systems.
Inf. Sci., 1993

Limiting the team size in cooperating grammar systems.
Bulletin of the EATCS, 1993

Limiting the team size in cooperating grammar systems.
Bulletin of the EATCS, 1993

1991
On the Power of Cooperation: A Regular Representation of Recursively Enumerable Languages.
Theor. Comput. Sci., 1991

On Bounded Interpretations of Grammar Forms.
Theor. Comput. Sci., 1991

1990
On Cooperating/Distributed Grammar Systems.
Elektronische Informationsverarbeitung und Kybernetik, 1990

1986
A connection between descriptional complexity of context-free grammars and grammar form theory.
Proceedings of the Trends, 1986


  Loading...