Specification and dialogue control of visual interaction through visual rewriting systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Membrane systems with carriers
Theoretical Computer Science
A pumping lemma for random permitting context languages
Theoretical Computer Science
Decidability of EDT0L structural equivalence
Theoretical Computer Science
Sequential grammars and automata with valances
Theoretical Computer Science
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Molecular computing paradigm – toward freedom from Turing's charm
Natural Computing: an international journal
Topics in the theory of DNA computing
Theoretical Computer Science - Natural computing
Theoretical Computer Science - Natural computing
Membrane systems with coupled transport: universality and normal forms
Fundamenta Informaticae - Membrane computing
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
Fundamenta Informaticae - Membrane computing
Even linear simple matrix languages: formal language properties and grammatical inference
Theoretical Computer Science
Universal computation with Watson-Crick DOL systems
Theoretical Computer Science
The power of communication: P systems with symport/antiport
New Generation Computing
On Emergence in Evolutionary Multiagent Systems
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Fragmentation: Enhancing Identifiability
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
A Hybrid System for the Recognition of Hand-Written Characters
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Rewriting P Systems with Conditional Communication
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
P Systems with Gemmation of Mobile Membranes
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Regulated Grammars with Leftmost Derivation
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Membrane Computing: When Communication Is Enough
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Multiset Processing by Means of Systems of Finite State Transducers
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Universality Results for Some Variants of P Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Toward a Formal Macroset Theory
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Artificial Life Applications of a Class of P Systems: Abstract Rewriting Systems on Multisets
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Parallel Rewriting P Systems without Target Conflicts
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Systems with Activated/Prohibited Membrane Channels
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Client-Server P Systems in Modeling Molecular Interaction
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Systems without Priorities Are Computationally Universal
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Evolution-Communication P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
String Rewriting Sequential P-Systems and Regulated Rewriting
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
On P Systems with Global Rules
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Parallel Rewriting P Systems with Deadlock
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
State and Transition Complexity of Watson-Crick Finite Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Computing with Membranes (P Systems): Universality Results
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
P Systems with Membrane Creation: Universality and Efficiency
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Nonterminal Complexity of Programmed Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
D0L System + Watson-Crick Complementarity = Universal Computation
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Two Normal Forms for Rewriting P Systems
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On The Power of Tissue P Systems Working in the Minimal Mode
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Rewriting P systems with conditional communication
Formal and natural computing
Nonterminal complexity of programmed grammars
Theoretical Computer Science
Gemmating P systems: collapsing hierarchies
Theoretical Computer Science
Theoretical Computer Science
On the sentence valuation in a semiring
Information Sciences—Informatics and Computer Science: An International Journal
On descriptions of context-free languages by CD grammar systems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Graph-controlled cooperating distributed grammar systems with singleton components
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Grammars with bounded-life resources
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Descriptional complexity of scattered rewriting and multirewriting: an overview
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Theoretical Computer Science
On three variants of rewriting P systems
Theoretical Computer Science
A property of random context picture grammars
Theoretical Computer Science
The splicing as an operation on formal languages
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Weighted grammars and automata with threshold interpretation
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Natural Computing: an international journal
From Watson-Crick L systems to Darwinian P systems
Natural Computing: an international journal
Watson-Crick D0L systems: generative power and undecidable problems
Theoretical Computer Science
Contextual grammars as generative models of natural languages
Computational Linguistics
From regulated rewriting to computing with membranes: collapsing hierarchies
Theoretical Computer Science
LR(k)-parsing of Coupled-Context-Free Grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Information and Computation
Evolution and observation: a non-standard way to generate formal languages
Theoretical Computer Science
On the power of membrane division in P systems
Theoretical Computer Science - Words, languages and combinatorics
Minimizing evolution-communication P systems and automata
New Generation Computing - Membrane computing
Hierarchies of parallel rewriting P systems: a survey
New Generation Computing - Membrane computing
P systems with local graph productions
New Generation Computing - Membrane computing
Results on catalytic and evolution-communication P systems
New Generation Computing - Membrane computing
Global Index Grammars and Descriptive Power
Journal of Logic, Language and Information
On the number of components in cooperating distributed grammar systems
Theoretical Computer Science - Descriptional complexity of formal systems
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
Theoretical Computer Science - Descriptional complexity of formal systems
Tissue P systems with channel states
Theoretical Computer Science - Insightful theory
On the applicability of Global Index Grammars
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
A remark on evolutionary systems
Discrete Applied Mathematics
Rewriting P systems: improved hierarchies
Theoretical Computer Science
The generative capacity of block-synchronized context-free grammars
Theoretical Computer Science
On state-alternating context-free grammars
Theoretical Computer Science
P Systems with Mobile Membranes
Natural Computing: an international journal
Descriptional complexity of rewriting P systems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Descriptional complexity of block-synchronization context-free grammars
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Some new aspects of word-length controlled DT0L systems
Journal of Automata, Languages and Combinatorics
P systems with conditional communication rules assigned to membranes
Journal of Automata, Languages and Combinatorics
Length synchronization context-free grammars
Journal of Automata, Languages and Combinatorics
Fundamenta Informaticae
Uniform Generation of Languages by Scattered Context Grammars
Fundamenta Informaticae
Valences in Lindenmayer Systems
Fundamenta Informaticae
Multisequential Grammars with Homogeneous Selectors
Fundamenta Informaticae
One-Turn Regulated Pushdown Automata and Their Reduction
Fundamenta Informaticae
Universality results for P systems based on brane calculi operations
Theoretical Computer Science
P systems without multiplicities of symbol-objects
Information Processing Letters
Time and Synchronization in Membrane Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Further Results on Contextual and Rewriting P Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Multiset random context grammars, checkers, and transducers
Theoretical Computer Science
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Active Symbols in Pure Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On Metalinear CD Grammar Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Degrees of non-monotonicity for restarting automata
Theoretical Computer Science
P systems with minimal parallelism
Theoretical Computer Science
Membrane Systems with Marked Membranes
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane Systems with Peripheral Proteins: Transport and Evolution
Electronic Notes in Theoretical Computer Science (ENTCS)
Descriptional complexity of semi-conditional grammars
Information Processing Letters
On the number of components for some parallel communicating grammar systems
Theoretical Computer Science
Canonical scattered context generators of sentences with their parses
Theoretical Computer Science
Self-regulating finite automata
Acta Cybernetica
A multiset-based model of synchronizing agents: Computability and robustness
Theoretical Computer Science
Fix point internal hierarchy specification for context free grammars
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Path Languages of Random Permitting Context Tree Grammars are Regular
Fundamenta Informaticae
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
A note on cooperating distributed grammar systems working in combined modes
Information Processing Letters
Decision problems in membrane systems with peripheral proteins, transport and evolution
Theoretical Computer Science
Membrane systems with proteins embedded in membranes
Theoretical Computer Science
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
Information and Computation
An integrating view on DNA computing and membrane computing
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
On the Computational Power of Enhanced Mobile Membranes
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
Language and Automata Theory and Applications
k-Petri Net Controlled Grammars
Language and Automata Theory and Applications
The Expressiveness of Concentration Controlled P Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Some New Modes of Competence-Based Derivations in CD Grammar Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Monotonicity of restarting automata
Journal of Automata, Languages and Combinatorics
Synchronization functions of synchronized context-free grammars and languages
Journal of Automata, Languages and Combinatorics
Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
Journal of Automata, Languages and Combinatorics
Note: On the descriptional complexity of scattered context grammars
Theoretical Computer Science
Fundamenta Informaticae
On Descriptional Complexity of Partially Parallel Grammars
Fundamenta Informaticae
Membrane computing with transport and embedded proteins
Theoretical Computer Science
Membrane Systems Using Noncooperative Rules with Unconditional Halting
Membrane Computing
Undecidability of Operation Problems for T0L Languages and Subclasses
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Grammars Controlled by Special Petri Nets
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Permutation Languages in Formal Linguistics
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Turing Completeness Using Three Mobile Membranes
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Parallel Communicating Grammar Systems with Regular Control
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Journal of Artificial Intelligence Research
A note on the descriptional complexity of semi-conditional grammars
Information Processing Letters
Notes: A remark on evolutionary systems
Discrete Applied Mathematics
Information and Computation
On the structure of graphic DLI-sets
DLT'02 Proceedings of the 6th international conference on Developments in language theory
LR parsing for global index languages (GILs)
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Characterizations of CD grammar systems working in competence mode by multicounter machine resources
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Effiscient learning of some linear matrix languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On pure multi-pushdown automata that perform complete pushdown pops
Acta Cybernetica
Regulated nondeterminism in pushdown automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Partial halting in P systems using membrane rules with permitting contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
On the power of networks of evolutionary processors
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
More on the size of higman-haines sets: effective constructions
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
GIGs: restricted context-sensitive descriptive power in bounded polynomial-time
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Simple restriction in context-free rewriting
Journal of Computer and System Sciences
On erasing productions in random context grammars
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On restricted context-free grammars
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Reversibility and determinism in sequential multiset rewriting
UC'10 Proceedings of the 9th international conference on Unconventional computation
Languages generated by context-free grammars extended by type AB → BA rules
Journal of Automata, Languages and Combinatorics
Computing by observing: Simple systems and simple observers
Theoretical Computer Science
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
Theoretical Computer Science
Decidability of operation problems for T0L languages and subclasses
Information and Computation
Stochastic grammars for intelligent software systems modeling
MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Communication membrane systems with active symports
Journal of Automata, Languages and Combinatorics
Power and efficiency of minimal parallelism in polarizationless P systems
Journal of Automata, Languages and Combinatorics
Rainbow of computer science
Mutual mobile membranes with objects on surface
Natural Computing: an international journal
Workspace theorems for regular-controlled grammars
Theoretical Computer Science
A general framework for regulated rewriting based on the applicability of rules
Computation, cooperation, and life
Cooperating distributed grammar systems: components with nonincreasing competence
Computation, cooperation, and life
On the expressive power of valences in cooperating distributed grammar systems
Computation, cooperation, and life
Generative power of eco-colonies
Computation, cooperation, and life
On some biologically motivated control devices for parallel rewriting
Computation, cooperation, and life
Nonterminal complexity of tree controlled grammars
Theoretical Computer Science
A sufficient condition for erasing productions to be avoidable
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Language classes generated by tree controlled grammars with bounded nonterminal complexity
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On the complexity of szilard languages of regulated grammars
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Computability power of mobility in enhanced mobile membranes
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Parsing algorithms for grammars with regulated rewriting
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
On restricted context-free grammars
Journal of Computer and System Sciences
Extended spiking neural p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Tissue p systems with communication modes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Membrane systems with external control
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Partial knowledge in membrane systems: a logical approach
WMC'06 Proceedings of the 7th international conference on Membrane Computing
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Replicative - distribution rules in p systems with active membranes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Modelling cellular processes using membrane systems with peripheral and integral proteins
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Symbol/Membrane complexity of p systems with symport/antiport rules
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Boolean circuits and a DNA algorithm in membrane computing
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Minimal parallelism for polarizationless p systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Tissue p systems with antiport rules and small numbers of symbols and cells
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the efficiency of p systems with active membranes and two polarizations
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Inhibiting/de-inhibiting rules in p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
P systems with symport/antiport: the traces of RBCs
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Computational completeness of p systems with active membranes and two polarizations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Computing by observing bio-systems: the case of sticker systems
DNA'04 Proceedings of the 10th international conference on DNA computing
On competence in CD grammar systems
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
P systems working in the sequential mode on arrays and strings
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Sequential and maximally parallel multiset rewriting: reversibility and determinism
Natural Computing: an international journal
On CD-systems of stateless deterministic R-automata with window size one
Journal of Computer and System Sciences
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Selected decision problems for square-refinement collage grammars
Algebraic Foundations in Computer Science
The power of mobility: four membranes suffice
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
An infinite hierarchy of languages defined by dP systems
Theoretical Computer Science
dP automata versus right-linear simple matrix grammars
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Ogden's lemma for ET0L languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules
Theoretical Computer Science
Language classes generated by tree controlled grammars with bounded nonterminal complexity
Theoretical Computer Science
Trade-Offs Between Time, Space, Cooperation, and Communication Complexity for CD Grammar Systems
Fundamenta Informaticae
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Path Languages of Random Permitting Context Tree Grammars are Regular
Fundamenta Informaticae
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
Fundamenta Informaticae
On Descriptional Complexity of Partially Parallel Grammars
Fundamenta Informaticae
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Active Symbols in Pure Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On Metalinear CD Grammar Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On the computability power of membrane systems with controlled mobility
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Time and Synchronization in Membrane Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Further Results on Contextual and Rewriting P Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Membrane Systems with Coupled Transport: Universality and Normal Forms
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
GP Systems with Forbidding Context
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
One-Turn Regulated Pushdown Automata and Their Reduction
Fundamenta Informaticae
Valences in Lindenmayer Systems
Fundamenta Informaticae
Uniform Generation of Languages by Scattered Context Grammars
Fundamenta Informaticae
Multisequential Grammars with Homogeneous Selectors
Fundamenta Informaticae
Membrane Computing with External Output
Fundamenta Informaticae
Fundamenta Informaticae
On Accepting Pure Lindenmayer Systems
Fundamenta Informaticae
On Synchronization in P Systems
Fundamenta Informaticae
An Efficient Parser for a Class of Contextual Languages
Fundamenta Informaticae
On Using Semi-Dyck Sets To Analyse Coupled-Context-Free Languages
Fundamenta Informaticae
Controlled H Systems and Chomsky Hierarchy
Fundamenta Informaticae
On a Hierarchy of Slender Languages Based on Control Sets
Fundamenta Informaticae
ON GRAMMAR AND LANGUAGE FAMILIES
Fundamenta Informaticae
SOME UNDECIDABILITY RESULTS CONCERNING k-LIMITED 0L SYSTEMS
Fundamenta Informaticae
GRAPH GRAMMARS WITH NEGATIVE APPLICATION CONDITIONS
Fundamenta Informaticae
LOGIC BASED PROGRAMMED STRUCTURE REWRITING SYSTEMS
Fundamenta Informaticae
Parallel communicating grammar systems with negotiation
Fundamenta Informaticae
On The Generative Capacity Of Certain Classes Of Cooperating Grammar Systems
Fundamenta Informaticae
Fundamenta Informaticae
Top-down deterministic parsing of languages generated by CD grammar systems
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
P systems with minimal left and right insertion and deletion
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
(Tissue) p systems with decaying objects
CMC'12 Proceedings of the 13th international conference on Membrane Computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Sequential p systems with regular control
CMC'12 Proceedings of the 13th international conference on Membrane Computing
On efficient algorithms for SAT
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Observer/Interpreter p systems
CMC'12 Proceedings of the 13th international conference on Membrane Computing
On the power of permitting features in cooperating context-free array grammar systems
Discrete Applied Mathematics
Left Random Context ET0L Grammars
Fundamenta Informaticae
The Complexity of Szilard Languages of Matrix Grammars Revisited
Fundamenta Informaticae
| Hi-index | 0.04 |