György Vaszil

According to our database1, György Vaszil
  • authored at least 82 papers between 1996 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
TCS Special Issue on Languages and Combinatorics in Theory and Nature.
Theor. Comput. Sci., 2017

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

Generalized P Colony Automata and Their Relation to P Automata.
Proceedings of the Membrane Computing, 2017

2016
Simulating P systems with membrane dissolution in a chemical calculus.
Natural Computing, 2016

On Lindenmayer Systems with Dynamic Control of Parallelism.
Journal of Automata, Languages and Combinatorics, 2016

Chemical Term Reduction with Active P Systems.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

2015
Deterministic One-Way Turing Machines with Sublinear Space.
Fundam. Inform., 2015

Spatially Localised Membrane Systems.
Fundam. Inform., 2015

Regulating Rule Application with Membrane Boundaries in P Systems.
Proceedings of the Membrane Computing, 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
Generalized P Colony Automata.
Journal of Automata, Languages and Combinatorics, 2014

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

Describing Membrane Computations with a Chemical Calculus.
Fundam. Inform., 2014

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

Deterministic one-way Turing machines with sublinear space bounds.
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
On the Nonterminal Complexity of Tree Controlled Grammars.
Proceedings of the Languages Alive, 2012

2011
On the Number of Active Symbols in Lindenmayer Systems.
Int. J. Found. Comput. Sci., 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

Variants of Distributed P Automata and the Efficient Parallelizability of Languages.
Proceedings of the Membrane Computing, 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

On the Parallelizability of Languages Accepted by P Automata.
Proceedings of the Computation, 2011

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

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

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
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

2008
(Mem)brane automata.
Theor. Comput. Sci., 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

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

Automata-like Membrane Systems - A Natural Way to Describe Complex Phenomena.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

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

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

Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components.
Journal of Automata, Languages and Combinatorics, 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 leftmost derivations in CD grammar systems.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 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

P Finite Automata and Regular Languages over Countably Infinite Alphabets.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

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

Ciliate Bio-operations on Finite String Multisets.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

On the Number of Active Symbols in Lindenmayer Systems.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
On the descriptional complexity of some rewriting mechanisms regulated by context conditions.
Theor. Comput. Sci., 2005

Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free Components.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
On the Size of P Systems with Minimal Symport/Antiport.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Reducing the Size of Extended Gemmating Systems.
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

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

Collapsing Hierarchies of Parallel Rewriting P Systems without Target Conflicts.
Proceedings of the Membrane Computing, International Workshop, 2003

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

On the Number of Conditional Productions in Simple Semi-conditional Grammars.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

On the Generative Capacity of Parallel Communicating Extended Lindenmayer Systems.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
Parallel communicating grammar systems with bounded resources.
Theor. Comput. Sci., 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

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

2000
Further Remarks on Parallel Communicating Grammar Systems without a Master.
Journal of Automata, Languages and Combinatorics, 2000

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

Parallel Communicating Grammar Systems As Language Analyzers.
Grammars, 2000

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

Communication in Parallel Communicating Lindenmayer Systems.
Grammars, 1999

On Parallel Communicating Lindemayer Systems.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Grammar Systems as Language Analyzers and Recursively Enumerable Languages.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
On Simulating Non-Returning PC Grammar Systems with Returning Systems.
Theor. Comput. Sci., 1998

Communication in Parallel Communicating Lindenmayer Systems (Extended Abstract).
Proceedings of the Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, 1998

1997
Various Communications in PC Grammar Systems.
Acta Cybern., 1997

1996
PCGSs Without a Master.
Computers and Artificial Intelligence, 1996


  Loading...