György Vaszil

J. Membr. Comput., September, 2024

Variants of distributed reaction systems.

[BibT_eX]

[DOI]

Nat. Comput., June, 2024

Networks of Watson-Crick D0L systems with communication by substrings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation.

[BibT_eX]

[DOI]

Patrik Adrián

Proceedings of the Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), 2024

Describing Computations of Membrane Systems with Petri Nets (invited paper).

[BibT_eX]

[DOI]

Proceedings of the 24th Conference Information Technologies, 2024

2023

Preface.

[BibT_eX]

[DOI]

Claudio Zandron

Gexiang Zhang

Nat. Comput., March, 2023

2022

Controlled reversibility in communicating reaction systems.

[BibT_eX]

[DOI]

Attila Bagossy

Theor. Comput. Sci., 2022

Rough-Set-Like Approximation Spaces for Formal Languages.

[BibT_eX]

[DOI]

Tamás Mihálydeák

J. Autom. Lang. Comb., 2022

Preface.

[BibT_eX]

[DOI]

Pál Dömösi

Int. J. Found. Comput. Sci., 2022

2021

Reversible parallel communicating finite automata systems.

[BibT_eX]

[DOI]

Acta Informatica, 2021

String Assembling Systems and Watson-Crick Finite Automata.

[BibT_eX]

[DOI]

András Murvai

Proceedings of the 21st Conference Information Technologies, 2021

2020

Local time membrane systems and time Petri nets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities.

[BibT_eX]

[DOI]

J. Membr. Comput., 2020

Simulating reversible computation with reaction systems.

[BibT_eX]

[DOI]

Attila Bagossy

J. Membr. Comput., 2020

Deterministic Lindenmayer Systems with Dynamic Control of Parallelism.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

On Languages of P Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

Transition Graphs of Reversible Reaction Systems.

[BibT_eX]

[DOI]

Attila Bagossy

Proceedings of the Membrane Computing, 2020

2019

Generalized Membrane Systems with Dynamical Structure, Petri Nets, and Multiset Approximation Spaces.

[BibT_eX]

[DOI]

Tamás Mihálydeák

Proceedings of the Unconventional Computation and Natural Computation, 2019

Membrane Systems and Multiset Approximation: The Cases of Inner and Boundary Rule Application.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets - International Joint Conference, 2019

2018

On the classes of languages characterized by generalized P colony automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the Complexity of a Mildly Context-Sensitive Language Class.

[BibT_eX]

[DOI]

Dávid Angyal

Benedek Nagy

J. Autom. Lang. Comb., 2018

Preface: Non-classical models of automata and applications VIII.

[BibT_eX]

[DOI]

Benedek Nagy

RAIRO Theor. Informatics Appl., 2018

APCol Systems with Verifier Agents.

[BibT_eX]

[DOI]

Lucie Ciencialová

Ludek Cienciala

Proceedings of the Membrane Computing, 2018

Deterministic Parsing with P Colony Automata.

[BibT_eX]

[DOI]

Proceedings of the Enjoying Natural Computing, 2018

2017

TCS Special Issue on Languages and Combinatorics in Theory and Nature.

[BibT_eX]

[DOI]

Florin Manea

Bianca Truthe

Theor. Comput. Sci., 2017

Watson-Crick T0L Systems and Red-Green Register Machines.

[BibT_eX]

[DOI]

Rudolf Freund

Fundam. Informaticae, 2017

Generalized P Colony Automata and Their Relation to P Automata.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2017

2016

Simulating P systems with membrane dissolution in a chemical calculus.

[BibT_eX]

[DOI]

Nat. Comput., 2016

On Lindenmayer Systems with Dynamic Control of Parallelism.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2016

Chemical Term Reduction with Active P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

2015

Deterministic One-Way Turing Machines with Sublinear Space.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Spatially Localised Membrane Systems.

[BibT_eX]

[DOI]

Marian Gheorghe

Mike Stannett

Fundam. Informaticae, 2015

Regulating Rule Application with Membrane Boundaries in P Systems.

[BibT_eX]

[DOI]

Tamás Mihálydeák

Proceedings of the Membrane Computing, 2015

Dynamically Changing Environment for Generalized Communicating P Systems.

[BibT_eX]

[DOI]

Ákos Balaskó

Proceedings of the Membrane Computing, 2015

A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems.

[BibT_eX]

[DOI]

Rudolf Freund

Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

2014

Generalized P Colony Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

P Automata with Restricted Power.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Describing Membrane Computations with a Chemical Calculus.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

2013

On the Power of P Automata.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2013

Deterministic one-way Turing machines with sublinear space bounds.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2013

2012

On the Nonterminal Complexity of Tree Controlled Grammars.

[BibT_eX]

[DOI]

Proceedings of the Languages Alive, 2012

2011

On the Number of Active Symbols in Lindenmayer Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Pc Grammar Systems with Clusters of Components.

[BibT_eX]

[DOI]

Marion Oswald

Int. J. Found. Comput. Sci., 2011

Blackhole Pushdown Automata.

[BibT_eX]

[DOI]

Tomás Masopust

Fundam. Informaticae, 2011

Expanding Formal Language and Automata Theory: Bio-inspired Computational Models.

[BibT_eX]

[DOI]

ERCIM News, 2011

Variants of Distributed P Automata and the Efficient Parallelizability of Languages.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2011

Finite dP Automata versus Multi-head Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2011

On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

On the Parallelizability of Languages Accepted by P Automata.

[BibT_eX]

[DOI]

Proceedings of the Computation, 2011

Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence.

[BibT_eX]

[DOI]

Maurice H. ter Beek

Markus Holzer

Proceedings of the Computation, 2011

2010

P automata.

[BibT_eX]

[DOI]

Scholarpedia, 2010

On the Descriptional Complexity of Context-Free Non-returning PC Grammar Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2010

Scattered context grammars generate any recursively enumerable language with two nonterminals.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Variants of Competence-Based Derivations in CD Grammar Systems.

[BibT_eX]

[DOI]

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

Blackhole State-Controlled Regulated Pushdown Automata.

[BibT_eX]

Tomás Masopust

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.

[BibT_eX]

[DOI]

Sergey Verlan

Proceedings of the Membrane Computing, 2010

2009

Dynamically formed Clusters of Agents in Eco-Grammar Systems.

[BibT_eX]

[DOI]

Katalin Anna Lázár

András Lörincz

Int. J. Found. Comput. Sci., 2009

Variants of P Colonies with Very Simple Cell Structure.

[BibT_eX]

[DOI]

Lucie Ciencialová

Alica Kelemenová

Int. J. Comput. Commun. Control, 2009

On the Size Complexity of Non-Returning Context-Free PC Grammar Systems

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

2008

(Mem)brane automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Preface.

[BibT_eX]

[DOI]

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

Tissue-Like P Systems with Dynamically Emerging Requests.

[BibT_eX]

[DOI]

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

Editing Configurations of P Systems.

[BibT_eX]

[DOI]

Antonio Di Nola

Mario J. Pérez-Jiménez

Fundam. Informaticae, 2008

Some New Modes of Competence-Based Derivations in CD Grammar Systems.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Automata-like Membrane Systems - A Natural Way to Describe Complex Phenomena.

[BibT_eX]

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

Self-assembly of strings and languages.

[BibT_eX]

[DOI]

Ion Petre

Theor. Comput. Sci., 2007

On small universal antiport P systems.

[BibT_eX]

[DOI]

Maurice Margenstern

Sergey Verlan

Theor. Comput. Sci., 2007

Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

On Competence in CD Grammar Systems with Parallel Rewriting.

[BibT_eX]

[DOI]

Maurice H. ter Beek

Markus Holzer

Int. J. Found. Comput. Sci., 2007

Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

P Systems with String Objects and with Communication by Request.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 8th International Workshop, 2007

On leftmost derivations in CD grammar systems.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

On a Variant of Parallel Communicating Grammar Systems with Communication by Command.

[BibT_eX]

[DOI]

Proceedings of the Formal Models, 2007

2006

On the Computational Complexity of P Automata.

[BibT_eX]

[DOI]

Oscar H. Ibarra

Nat. Comput., 2006

P Finite Automata and Regular Languages over Countably Infinite Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 7th International Workshop, 2006

P Colonies with a Bounded Number of Cells and Programs.

[BibT_eX]

[DOI]

Maurice Margenstern

Proceedings of the Membrane Computing, 7th International Workshop, 2006

Ciliate Bio-operations on Finite String Multisets.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

On the descriptional complexity of some rewriting mechanisms regulated by context conditions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

On the Size of P Systems with Minimal Symport/Antiport.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 5th International Workshop, 2004

Reducing the Size of Extended Gemmating Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 5th International Workshop, 2004

On Competence in CD Grammar Systems.

[BibT_eX]

[DOI]

Maurice H. ter Beek

Markus Holzer

Proceedings of the Developments in Language Theory, 2004

2003

PC grammar systems with five context-free components generate all recursively enumerable languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Collapsing Hierarchies of Parallel Rewriting P Systems without Target Conflicts.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, International Workshop, 2003

Distributed Pushdown Automata Systems: Computational Power.

[BibT_eX]

[DOI]

Victor Mitrana

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

On the Number of Conditional Productions in Simple Semi-conditional Grammars.

[BibT_eX]

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.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Parallel Communicating Grammar Systems with Incomplete Information Communication.

[BibT_eX]

[DOI]

Grammars, 2002

P Automata or Purely Communicating Accepting P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, International Workshop, 2002

2001

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

2000

Further Remarks on Parallel Communicating Grammar Systems without a Master.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2000

Parallel Communicating Pushdown Automata Systems.

[BibT_eX]

[DOI]

Carlos Martín-Vide

Victor Mitrana

Int. J. Found. Comput. Sci., 2000

Parallel Communicating Grammar Systems As Language Analyzers.

[BibT_eX]

[DOI]

Grammars, 2000

1999

On the Computational Completeness of Context-Free Parallel Communicating Grammar Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Communication in Parallel Communicating Lindenmayer Systems.

[BibT_eX]

[DOI]

Grammars, 1999

On Parallel Communicating Lindemayer Systems.

[BibT_eX]

Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Grammar Systems as Language Analyzers and Recursively Enumerable Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

On Simulating Non-Returning PC Grammar Systems with Returning Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Communication in Parallel Communicating Lindenmayer Systems (Extended Abstract).

[BibT_eX]

Proceedings of the Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, 1998

1997

Various Communications in PC Grammar Systems.

[BibT_eX]

[DOI]

Acta Cybern., 1997

1996

PCGSs Without a Master.

[BibT_eX]

[DOI]