György Vaszil

From MaRDI portal
Person:407597

Available identifiers

zbMath Open vaszil.gyorgyMaRDI QIDQ407597

List of research outcomes





PublicationDate of PublicationType
Networks of Watson-Crick D0L systems with communication by substrings2024-03-28Paper
Membrane systems and multiset approximation: the cases of inner and boundary rule application2023-12-01Paper
https://portal.mardi4nfdi.de/entity/Q58675172022-09-14Paper
Controlled reversibility in communicating reaction systems2022-07-08Paper
Transition graphs of reversible reaction systems2021-12-01Paper
Simulating reversible computation with reaction systems2021-09-14Paper
Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities2021-09-14Paper
Reversible parallel communicating finite automata systems2021-07-23Paper
https://portal.mardi4nfdi.de/entity/Q51465192021-01-26Paper
On Languages of P Automata2020-06-21Paper
Deterministic Lindenmayer Systems with Dynamic Control of Parallelism2020-02-21Paper
Local time membrane systems and time Petri nets2020-01-08Paper
Generalized membrane systems with dynamical structure, Petri nets, and multiset approximation spaces2019-10-10Paper
APCol systems with verifier agents2019-10-10Paper
Simulating P systems with membrane dissolution in a chemical calculus2019-07-10Paper
Deterministic parsing with \(\mathrm{P}\) colony automata2019-01-15Paper
https://portal.mardi4nfdi.de/entity/Q53763282018-09-17Paper
Generalized P colony automata and their relation to P automata2018-05-16Paper
On the classes of languages characterized by generalized P colony automata2018-04-10Paper
Watson-Crick T0L Systems and Red-Green Register Machines2018-01-19Paper
Chemical Term Reduction with Active P Systems2017-04-12Paper
https://portal.mardi4nfdi.de/entity/Q31788702016-12-20Paper
https://portal.mardi4nfdi.de/entity/Q55070662016-12-16Paper
On the descriptional complexity of context-free non-returning PC grammar systems2016-09-29Paper
Spatially localised membrane systems2016-05-11Paper
Deterministic one-way Turing machines with sublinear space2016-05-11Paper
Dynamically Changing Environment for Generalized Communicating P Systems2016-02-26Paper
Regulating Rule Application with Membrane Boundaries in P Systems2016-02-26Paper
A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems2015-09-15Paper
Describing Membrane Computations with a Chemical Calculus2015-06-26Paper
Generalized Communicating P Automata2015-04-14Paper
P automata with restricted power2014-11-14Paper
On Counter Machines versus dP Automata2014-03-28Paper
On the Power of P Automata2013-06-28Paper
On the Nonterminal Complexity of Tree Controlled Grammars2012-11-01Paper
Finite dP Automata versus Multi-head Finite Automata2012-06-08Paper
Variants of Distributed P Automata and the Efficient Parallelizability of Languages2012-06-08Paper
Blackhole pushdown automata2012-05-04Paper
Scattered context grammars generate any recursively enumerable language with two nonterminals2012-03-27Paper
On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems2011-07-29Paper
On the Parallelizability of Languages Accepted by P Automata2011-06-24Paper
Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence2011-06-24Paper
ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS2011-02-23Paper
PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS2011-02-23Paper
On Generalized Communicating P Systems with One Symbol2011-01-21Paper
VARIANTS OF COMPETENCE-BASED DERIVATIONS IN CD GRAMMAR SYSTEMS2010-09-06Paper
ON COMPETENCE IN CD GRAMMAR SYSTEMS WITH PARALLEL REWRITING2010-01-29Paper
DYNAMICALLY FORMED CLUSTERS OF AGENTS IN ECO-GRAMMAR SYSTEMS2009-06-23Paper
Self-assembly of strings and languages2009-06-22Paper
Membrane Computing2009-05-15Paper
Ciliate Bio-operations on Finite String Multisets2009-03-26Paper
TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS2008-11-24Paper
(Mem)brane automata2008-11-06Paper
Some New Modes of Competence-Based Derivations in CD Grammar Systems2008-10-30Paper
Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components2008-08-12Paper
P Systems with String Objects and with Communication by Request2008-03-28Paper
Editing configurations of P systems2008-03-19Paper
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems2008-02-26Paper
Computing with cells in environment: P colonies2008-02-11Paper
Tissue-like P systems communicating by request2007-12-11Paper
P Finite Automata and Regular Languages over Countably Infinite Alphabets2007-09-03Paper
P Colonies with a Bounded Number of Cells and Programs2007-09-03Paper
On the computational complexity of P automata2007-04-19Paper
Grammar systems versus membrane computing: the case of CD grammar systems2007-04-10Paper
On small universal antiport P systems2007-03-27Paper
DNA Computing2006-10-19Paper
Developments in Language Theory2005-12-22Paper
Membrane Computing2005-09-14Paper
Membrane Computing2005-09-14Paper
On the descriptional complexity of some rewriting mechanisms regulated by context conditions2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q47379232004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44531992004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44520642004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44138282003-07-21Paper
PC grammar systems with five context-free components generate all recursively enumerable languages.2003-05-25Paper
Parallel communicating grammar systems with incomplete information communication2003-04-27Paper
Parallel communicating grammar systems with bounded resources2002-07-15Paper
On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms2001-08-20Paper
Parallel communicating grammar systems as language analyzers2001-06-21Paper
PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS2001-02-11Paper
https://portal.mardi4nfdi.de/entity/Q49343242000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q49391912000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q49532422000-05-09Paper
Communication in parallel communicating Lindenmayer systems1999-11-10Paper
https://portal.mardi4nfdi.de/entity/Q42691231999-10-31Paper
On the computational completeness of context-free parallel communicating grammar systems1999-04-29Paper
On simulating non-returning PC grammar systems with returning systems1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q48867991996-12-11Paper

Research outcomes over time

This page was built for person: György Vaszil