Marion Oswald - Citegraph

Author Info

Name	Affiliation	Papers
MARION OSWALD	Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9, A-1040 Wien, Austria. E-mails: rudi@emcc.at/ marion@emcc.at	41
Collaborators	Citations	PageRank
27	320	30.27
Referers	Referees	References
268	154	251

Search Limit

100268

Publications (41 rows)

Collaborators (27 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Relations Between Control Mechanisms For Sequential Grammars	0	0.34	2021
Extended spiking neural P systems with white hole rules and their red–green variants	1	0.35	2018
Chocolate P Automata.	0	0.34	2018
Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness.	2	0.40	2015
Algebraic Representation of Regular Array Languages on Cayley Graphs.	0	0.34	2014
One-Dimensional Array Grammars And P Systems With Array Insertion And Deletion Rules	2	0.38	2013
Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness.	0	0.34	2013
Sequential p systems with regular control	6	0.72	2012
A general framework for regulated rewriting based on the applicability of rules	12	0.90	2011
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions	4	0.47	2009
Extended Spiking Neural P Systems With Decaying Spikes And/Or Total Spiking	15	1.11	2008
Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings	18	1.73	2008
Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems	0	0.34	2008
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode	2	0.44	2007
Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings	3	0.39	2007
Partial halting in P systems using membrane rules with permitting contexts	3	0.39	2007
Multiset random context grammars, checkers, and transducers	6	0.65	2007
Partial Halting In P Systems	1	0.36	2007
Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars	15	1.01	2007
Cd Grammar Systems With Regular Start Conditions	0	0.34	2007
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes	10	0.57	2006
P Colonies And Prescribed Teams	5	0.50	2006
Extended spiking neural p systems	13	0.74	2006
A Small Universal Antiport P System with Forbidden Context.	2	0.39	2006
Cell/Symbol Complexity Of Tissue P Systems With Symport/Antiport Rules	7	0.56	2006
P Colonies Working in the Maximally Parallel and in the Sequential Mode	16	1.47	2005
Symbol/Membrane complexity of p systems with symport/antiport rules	11	0.84	2005
Computationally universal P systems without priorities: two catalysts are sufficient	67	3.83	2005
Refining the Nonterminal Complexity of Graph-controlled Grammars.	3	0.57	2005
Modelling artificial life by attributed eco-array grammars	0	0.34	2005
Optimal Results For The Computational Completeness Of Gemmating (Tissue) P Systems	1	0.39	2005
Tissue p systems with antiport rules and small numbers of symbols and cells	20	1.27	2005
P Automata with membrane channels.	0	0.34	2004
Sequential p systems with unit rules and energy assigned to membranes	15	0.99	2004
Implementation of Catalytic P Systems	4	0.51	2004
Gemmating P Systems are Computationally Complete with Four Membranes.	4	0.52	2004
P systems generating trees	6	0.73	2004
P Automata with membrane channels	1	0.36	2004
omega-P Automata with Communication Rules	4	0.51	2003
A Short Note on Analysing P Systems with Antiport Rules	14	1.45	2002
P Systems with Activated/Prohibited Membrane Channels	27	2.06	2002