Marion Oswald

According to our database1, Marion Oswald authored at least 45 papers between 2002 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Extended spiking neural P systems with white hole rules and their red-green variants.
Natural Computing, 2018

2015
Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness.
Fundam. Inform., 2015

2014
Array Grammars and Automata on Cayley Grids.
Journal of Automata, Languages and Combinatorics, 2014

Algebraic Representation of Regular Array Languages on Cayley Graphs.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Something Bad Might Happen: Lawyers, anonymization and risk.
ACM Crossroads, 2013

One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

2012
Sequential P Systems with Regular Control.
Proceedings of the Membrane Computing, 2012

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

A General Framework for Regulated Rewriting Based on the Applicability of Rules.
Proceedings of the Computation, 2011

2009
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions.
Fundam. Inform., 2009

2008
Cd Grammar Systems with Regular Start Conditions.
Int. J. Found. Comput. Sci., 2008

Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking.
Int. J. Found. Comput. Sci., 2008

Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems.
Fundam. Inform., 2008

2007
Multiset random context grammars, checkers, and transducers.
Theor. Comput. Sci., 2007

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
Journal of Automata, Languages and Combinatorics, 2007

Partial Halting in P Systems.
Int. J. Found. Comput. Sci., 2007

Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode.
Fundam. Inform., 2007

Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings.
Electr. Notes Theor. Comput. Sci., 2007

Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

CD Grammar Systems with Regular Start Conditions.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

2006
Cell/symbol complexity of tissue P systems with symport/antiport rules.
Int. J. Found. Comput. Sci., 2006

P colonies and prescribed teams.
Int. J. Comput. Math., 2006

(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes.
Fundam. Inform., 2006

Extended Spiking Neural P Systems.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

A Small Universal Antiport P System with Forbidden Context.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
Computationally universal P systems without priorities: two catalysts are sufficient.
Theor. Comput. Sci., 2005

Optimal results for the computational completeness of gemmating (tissue) P systems.
Int. J. Found. Comput. Sci., 2005

P Colonies Working in the Maximally Parallel and in the Sequential Mode.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

Refining the Nonterminal Complexity of Graph-controlled Grammars.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
P Systems with Local Graph Productions.
New Generation Comput., 2004

P Systems with Conditional Communication Rules Assigned to Membranes.
Journal of Automata, Languages and Combinatorics, 2004

Implementation of Catalytic P Systems.
Proceedings of the Implementation and Application of Automata, 2004

P Systems Generating Trees.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Sequential P Systems with Unit Rules and Energy Assigned to Membranes.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Gemmating P Systems are Computationally Complete with Four Membranes.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems.
Proceedings of the Aspects of Molecular Computing, 2004

2003
omega-P Automata with Communication Rules.
Proceedings of the Membrane Computing, International Workshop, 2003

P Systems with Cutting/Recombination Rules Assigned to Membranes.
Proceedings of the Membrane Computing, International Workshop, 2003

Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002
GP Systems with Forbidding Context.
Fundam. Inform., 2002

A Short Note on Analysing P Systems with Antiport Rules.
Bulletin of the EATCS, 2002

P Systems with Activated/Prohibited Membrane Channels.
Proceedings of the Membrane Computing, International Workshop, 2002


  Loading...