Information and Computation
Iterated function systems and control languages
Information and Computation
ACM SIGMOD Record
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On the injectivity of the Parikh matrix mapping
Fundamenta Informaticae
Journal of Logic, Language and Information
Factorizations of languages and commutativity conditions
Acta Cybernetica
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The equality problem for Parikh simple algebraic power series
Information Processing Letters
A logical characterization of data languages
Information Processing Letters
Open Systems and Consciousness. A Physical Discussion
Open Systems & Information Dynamics
Theoretical Computer Science - Natural computing
Membrane systems with coupled transport: universality and normal forms
Fundamenta Informaticae - Membrane computing
Recursive calculus with membranes
Fundamenta Informaticae - Membrane computing
On the power of P Systems with contextual rules
Fundamenta Informaticae - Membrane computing
Fundamenta Informaticae - Membrane computing
On the power of P Systems with DNA-worm-objects
Fundamenta Informaticae - Membrane computing
Universal computation with Watson-Crick DOL systems
Theoretical Computer Science
On some operations on strings suggested by gene assembly in ciliates
New Generation Computing
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
Stochastic k-testable Tree Languages and Applications
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Processing XML Streams with Deterministic Automata
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Petri Net Control for Grammar Systems
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Rewriting P Systems with Conditional Communication
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Codes, Involutions, and DNA Encodings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
The Essence of XML (Preliminary Version)
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
On the Power of Tree-Walking Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
P Systems with Gemmation of Mobile Membranes
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Membrane Computing: When Communication Is Enough
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Word Random Access Compression
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
On the Size of Deterministic Finite Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Authentication of Messages Using P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
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
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Automata or Purely Communicating Accepting P Systems
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
Parallel Communicating Grammar Systems with Incomplete Information Communication
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
An Undecidability Result Concerning Periodic Morphisms
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
String Tile Models for DNA Computing by Self-Assembly
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
A Clause String DNA Algorithm for SAT
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
Shortening the Computational Time of the Fluorescent DNA Computing
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
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
How to Make SQL Stand for String Query Language
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
From Searching Text to Querying XML Streams
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Languages, D0L-systems, sets of curves, and surface automorphisms
Information and Computation
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
Petri net control for grammar systems
Formal and natural computing
Rewriting P systems with conditional communication
Formal and natural computing
Codes, involutions, and DNA encodings
Formal and natural computing
Gemmating P systems: collapsing hierarchies
Theoretical Computer Science
Theoretical Computer Science
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On algebraic and logical specifications of classes of regular languages
Theoretical Computer Science - Australasian computer science
Toward a formalization of emergence
Artificial Life
Power and size of extended Watson--Crick Lsystems
Theoretical Computer Science
On images of DOL and DTOL power series
Theoretical Computer Science
An algebraic approach to data languages and timed languages
Information and Computation
Grammars with bounded-life resources
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
PC grammar systems with five context-free components generate all recursively enumerable languages
Theoretical Computer Science
On congruences of automata defined by directed graphs
Theoretical Computer Science
Watson--Crick D0L systems: the power of one transition
Theoretical Computer Science
On three variants of rewriting P systems
Theoretical Computer Science
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
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)
Decidability results for Watson--Crick D0L systems with nonregular triggers
Theoretical Computer Science
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
On D0L systems with finite axiom sets
Acta Cybernetica
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
Theoretical Computer Science
The computational power of cell division in P systems: Beating down parallel computers?
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
Theoretical Computer Science
On the entropy of regular languages
Theoretical Computer Science - WORDS
Some variants in communication of parallel communicating pushdown automata
Journal of Automata, Languages and Combinatorics
Theoretical Computer Science
Contextual grammars as generative models of natural languages
Computational Linguistics
Subword histories and Parikh matrices
Journal of Computer and System Sciences
From regulated rewriting to computing with membranes: collapsing hierarchies
Theoretical Computer Science
From searching text to querying XML streams
Journal of Discrete Algorithms - SPIRE 2002
Branching synchronization grammars with nested tables
Journal of Computer and System Sciences
Asymptotically optimal low-cost solid codes
Journal of Automata, Languages and Combinatorics
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
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
Hierarchies of parallel rewriting P systems: a survey
New Generation Computing - Membrane computing
Language equations, maximality and error-detection
Journal of Computer and System Sciences
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
On the size complexity of hybrid networks of evolutionary processors
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
Context-free insertion-deletion systems
Theoretical Computer Science - Descriptional complexity of formal systems
Tissue P systems with channel states
Theoretical Computer Science - Insightful theory
Interactive manipulation of regular objects with FAdo
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Meta-EAH: an adaptive encoder based on adaptive codes. Moving between adaptive mechanisms
ISICT '04 Proceedings of the 2004 international symposium on Information and communication technologies
On properties of bond-free DNA languages
Theoretical Computer Science
P Systems with Mobile Membranes
Natural Computing: an international journal
An n 2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet
Journal of Computer and System Sciences
Decidability of trajectory-based equations
Theoretical Computer Science - Mathematical foundations of computer science 2004
A boundary result on enhanced time-varying distributed H systems with parallel computations
Theoretical Computer Science
P systems with conditional communication rules assigned to membranes
Journal of Automata, Languages and Combinatorics
Theoretical Computer Science
Aspects of shuffle and deletion on trajectories
Theoretical Computer Science
The South African sign language machine translation project: issues on non-manual sign generation
SAICSIT '06 Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Fundamenta Informaticae
On Variants of Communicating Distributed H Systems
Fundamenta Informaticae
Subword conditions and subword histories
Information and Computation
P systems without multiplicities of symbol-objects
Information Processing Letters
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On P Systems and Almost Periodicity
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Contextual Grammars with Subregular Choice
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fast Data Compression with Antidictionaries
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On Characterizing Recursively Enumerable Languages by Insertion Grammars
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On the Injectivity of Parikh Matrix Mappings
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
P Systems with Proteins on Membranes
Fundamenta Informaticae
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Injectivity of the Parikh Matrix Mappings Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
A Possible Connection Between Two Theories: Grammar Systems and Concurrent Programming
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Monocultures and Homogeneous Environment in Eco-Grammar Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Parallel communicating Watson-Crick automata systems
Acta Cybernetica
On the existence of prime decompositions
Theoretical Computer Science
Algebraic properties of substitution on trajectories
Theoretical Computer Science
On codes defined by bio-operations
Theoretical Computer Science
Infinite unfair shuffles and associativity
Theoretical Computer Science
Integrating generative growth and evolutionary computation for form exploration
Genetic Programming and Evolvable Machines
Agent-environment interaction in a multi-agent system: a formal model
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
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)
Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings
Electronic Notes in Theoretical Computer Science (ENTCS)
Communication via Mobile Vesicles in Brane Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing the edit distance of a regular language
Information and Computation
Theoretical Computer Science
Transition complexity of language operations
Theoretical Computer Science
Parikh matrices and amiable words
Theoretical Computer Science
Cancellation and periodicity properties of iterated morphisms
Theoretical Computer Science
A multiset-based model of synchronizing agents: Computability and robustness
Theoretical Computer Science
Extended spiking neural P systems with excitatory and inhibitory astrocytes
EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
Discontinuities in pattern inference
Theoretical Computer Science
On length-separating test tube systems
Natural Computing: an international journal
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
Non-preserving splicing with delay
International Journal of Computer Mathematics
A general approach for building combinational P automata
International Journal of Computer Mathematics
International Journal of Computer Mathematics - Celebrating the Life of David J. Evans
Equivalence in template-guided recombination
Natural Computing: an international journal
Decision problems in membrane systems with peripheral proteins, transport and evolution
Theoretical Computer Science
Membrane systems with proteins embedded in membranes
Theoretical Computer Science
Generalized communicating P systems
Theoretical Computer Science
An integrating view on DNA computing and membrane computing
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Deterministic Simulation of a NFA with k---Symbol Lookahead
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Hairpin Completion Versus Hairpin Reduction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On the Computational Power of Flip-Flop Proteins on Membranes
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
An Interaction Protocol for Agent Communication
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Computing by Observing: A Brief Survey
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Finite Automata, Palindromes, Powers, and Patterns
Language and Automata Theory and Applications
Further Results on Insertion-Deletion Systems with One-Sided Contexts
Language and Automata Theory and Applications
Length Codes, Products of Languages and Primality
Language and Automata Theory and Applications
Some New Modes of Competence-Based Derivations in CD Grammar Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning Context-Sensitive Languages from Linear Structural Information
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Subword histories and associated matrices
Theoretical Computer Science
International Journal of Computer Mathematics
Journal of Automata, Languages and Combinatorics
Journal of Automata, Languages and Combinatorics
On minimal context-free insertion-deletion systems
Journal of Automata, Languages and Combinatorics
On pseudoknot-bordered words and their properties
Journal of Computer and System Sciences
Characterizing DNA Bond Shapes Using Trajectories
Fundamenta Informaticae
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science
Membrane Systems Using Noncooperative Rules with Unconditional Halting
Membrane Computing
Event-Driven Metamorphoses of P Systems
Membrane Computing
Translating Multiset Tree Automata into P Systems
Membrane Computing
DNA splicing: computing by observing
Natural Computing: an international journal
How to make biological systems compute: simply observe them
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Algorithms for learning regular expressions from positive data
Information and Computation
Maximal error-detecting capabilities of formal languages
Journal of Automata, Languages and Combinatorics
On the Generative Powers of Some Extensions of Minimal Linear Grammars
IEICE - Transactions on Information and Systems
Theoretical Computer Science
State Complexity of Nested Word Automata
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
New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On some algorithmic problems regarding the hairpin completion
Discrete Applied Mathematics
Theoretical Computer Science
Asynchronous spiking neural P systems
Theoretical Computer Science
Theoretical Computer Science
Twin-roots of words and their properties
Theoretical Computer Science
State complexity of unique rational operations
Theoretical Computer Science
The equality problem for infinite words generated by primitive morphisms
Information and Computation
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
On the descriptional complexity of Watson-Crick automata
Theoretical Computer Science
Two collapsing hierarchies of subregularly tree controlled languages
Theoretical Computer Science
Recombination Patterns for Natural Syntax
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
Fundamenta Informaticae
Dependency trees and the strong generative capacity of CCG
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Networks of Evolutionary Picture Processors with Filtered Connections
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
An Undecidable Permutation of the Natural Numbers
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Minimality in template-guided recombination
Information and Computation
Variants of codes and indecomposable languages
Information and Computation
Complexity measures for binding-blocking automata
Journal of Automata, Languages and Combinatorics
Bad news on decision problems for patterns
Information and Computation
A note on the descriptional complexity of semi-conditional grammars
Information Processing Letters
A Similarity Measure for Cyclic Unary Regular Languages
Fundamenta Informaticae
Uniformly bounded duplication languages
Discrete Applied Mathematics
The class of HDT0L sequences is closed with respect to rational functions
Information Processing Letters
Roots and powers of regular languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Implementation of dictionaries via automata and decision trees
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Distributed pushdown automata systems: computational power
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Branching grammars: a generalization of ET0L systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Autonomous units and their semantics: the parallel case
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Decidability and undecidability of marked PCP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A star operation for star-free trace languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
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
Insertion-deletion systems with one-sided contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
P systems with string objects and with communication by request
WMC'07 Proceedings of the 8th international conference on Membrane computing
A formal framework for static (tissue) P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Characterizing membrane structures through multiset tree automata
WMC'07 Proceedings of the 8th international conference on Membrane computing
DNA splicing systems: an ordinary differential equations model and simulation
DNA13'07 Proceedings of the 13th international conference on DNA computing
Equivalence in template-guided recombination
DNA13'07 Proceedings of the 13th international conference on DNA computing
Restricted global grammar constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An efficient online parser for contextual grammars with at most context-free selectors
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Schema design for XML repositories: complexity and tractability
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Existence and nonexistence of descriptive patterns
Theoretical Computer Science
Inclusion problems in trace monoids
Cybernetics and Systems Analysis
Subword balance, position indices and power sums
Journal of Computer and System Sciences
Spiking neural p systems with weights
Neural Computation
Restricted ambiguity of erasing morphisms
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the density of regular and context-free languages
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
An efficient derivation method for DTOL systems and a measure of derivation complexity
Journal of Automata, Languages and Combinatorics
On generalized communicating P systems with minimal interaction rules
Theoretical Computer Science
P systems with minimal insertion and deletion
Theoretical Computer Science
Low Disruption Transformations on Cyclic Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Target Based Accepting Networks of Evolutionary Processors
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
On the size of inverse semigroups given by generators
Theoretical Computer Science
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Information and Computation
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality
Information and Computation
The family of languages generated by non-cooperative membrane systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
On generalized communicating P systems with one symbol
CMC'10 Proceedings of the 11th international conference on Membrane computing
Matrix insertion-deletion systems for bio-molecular structures
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Natural Computing: an international journal
Time-free spiking neural p systems
Neural Computation
Communication membrane systems with active symports
Journal of Automata, Languages and Combinatorics
Learning regular tree languages from correction and equivalence queries
Journal of Automata, Languages and Combinatorics
Rainbow of computer science
Computational power of insertion---deletion (P) systems with rules of size two
Natural Computing: an international journal
(Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode
Natural Computing: an international journal
Computation, cooperation, and life
A general framework for regulated rewriting based on the applicability of rules
Computation, cooperation, and life
CD grammar systems: competence and confidence
Computation, cooperation, and life
Cooperating distributed grammar systems: components with nonincreasing competence
Computation, cooperation, and life
On the parallelizability of languages accepted by P automata
Computation, cooperation, and life
On some biologically motivated control devices for parallel rewriting
Computation, cooperation, and life
On normal forms for networks of evolutionary processors
UC'11 Proceedings of the 10th international conference on Unconventional computation
Extended Watson-Crick L systems with regular trigger languages
UC'11 Proceedings of the 10th international conference on Unconventional computation
Networks of evolutionary processors with subregular filters
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Undecidability of the state complexity of composed regular operations
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Computing languages with bio-inspired devices and multi-agent systems
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Nonterminal complexity of tree controlled grammars
Theoretical Computer Science
Deciding networks of evolutionary processors
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the degree of team cooperation in CD grammar systems
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On contextual grammars with subregular selection languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
k-local internal contextual grammars
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
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
Agent-Systems and Formal Languages
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Reaction-driven membrane systems
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
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
Modeling dynamical parallelism in bio-systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
A protein substructure based p system for description and analysis of cell signalling networks
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Identifying p rules from membrane structures with an error-correcting approach
WMC'06 Proceedings of the 7th international conference on Membrane Computing
UC'06 Proceedings of the 5th international conference on Unconventional Computation
DNA'05 Proceedings of the 11th international conference on DNA Computing
DNA'05 Proceedings of the 11th international conference on DNA Computing
Upper and lower bounds for the computational power of p systems with mobile membranes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Replicative - distribution rules in p systems with active membranes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Artificial life for natural language processing
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
Note: Absoluteness of subword inequality is undecidable
Theoretical Computer Science
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
On evolutionary lineages of membrane systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Symbol/Membrane complexity of p systems with symport/antiport rules
WMC'05 Proceedings of the 6th international conference on Membrane Computing
WMC'05 Proceedings of the 6th international conference on Membrane Computing
P systems and the modeling of biochemical oscillations
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
Editing distances between membrane structures
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Non-cooperative p systems with priorities characterize PsET0L
WMC'05 Proceedings of the 6th international conference on Membrane Computing
A grammatical framework for modelling multi-agent dialogues
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Spiking Neural P Systems with Weighted Synapses
Neural Processing Letters
Hairpin structures defined by DNA trajectories
DNA'06 Proceedings of the 12th international conference on DNA Computing
On language inequalities XK ⊆ LX
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Algebraic characterization of the finite power property
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Contextual information systems
CONTEXT'05 Proceedings of the 5th international conference on Modeling and Using Context
Main concepts of networks of transformation units with interlinking semantics
Formal Methods in Software and Systems Modeling
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The power of commuting with finite sets of words
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Simulating evolutionary algorithms with eco-grammar systems
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
An automata-theoretic characterization of the chomsky-hierarchy
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
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
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
Reducing the size of extended gemmating p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the size of p systems with minimal symport/antiport
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
Evolution and observation: a non-standard way to accept formal languages
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 beyond the turing limit using the h systems
DNA'04 Proceedings of the 10th international conference on DNA computing
On the computational complexity of P automata
DNA'04 Proceedings of the 10th international conference on DNA computing
Preventing undesirable bonds between DNA codewords
DNA'04 Proceedings of the 10th international conference on DNA computing
DNA'04 Proceedings of the 10th international conference on DNA computing
Spiking neural p systems with astrocytes
Neural Computation
Substitutions, trajectories and noisy channels
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Semantic shuffle on and deletion along trajectories
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
Relating tree series transducers and weighted tree automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the equivalence problem for e-pattern languages over small alphabets
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the Hausdorff measure of ω-power languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Control flow analysis of UML 2.0 sequence diagrams
ECMDA-FA'05 Proceedings of the First European conference on Model Driven Architecture: foundations and Applications
State complexity of union and intersection of star on k regular languages
Theoretical Computer Science
On weakly ambiguous finite transducers
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Characterizing DNA bond shapes using trajectories
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Quantum automata theory – a review
Algebraic Foundations in Computer Science
A new model for classifying DNA code inspired by neural networks and FSA
PKAW'06 Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management
P automata: concepts, results, and new aspects
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Look-Ahead evolution for p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
The power of mobility: four membranes suffice
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Eco-Grammar systems as models for parallel evolutionary algorithms
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Theoretical Computer Science
Invariance and universality of complexity
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Circular post machines and p systems with exo-insertion and deletion
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Finite dp automata versus multi-head finite automata
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Sequentiality induced by spike number in SNP systems: small universal machines
CMC'11 Proceedings of the 12th international conference on Membrane Computing
On group automata over finite fields
Finite Fields and Their Applications
On external contextual grammars with subregular selection languages
Theoretical Computer Science
Language classes generated by tree controlled grammars with bounded nonterminal complexity
Theoretical Computer Science
Fundamenta Informaticae
Computing k-block Morphisms by Spiking Neural P Systems
Fundamenta Informaticae
P Systems with Insertion and Deletion Exo-Operations
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
The Sequence Equivalence Problem for Marked DT0L Systems
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Limited Asynchronous Spiking Neural P Systems
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Universality of Splicing Test Tube Systems with Two Tubes
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
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
Syntactic complexities of some classes of star-free languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Production complexity of some operations on context-free languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
On internal contextual grammars with subregular selection languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
Matrix insertion-deletion systems
Theoretical Computer Science
Complexity results for deciding Networks of Evolutionary Processors
Theoretical Computer Science
Fundamenta Informaticae
Homogeneous Spiking Neural P Systems
Fundamenta Informaticae
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
Characterizing DNA Bond Shapes Using Trajectories
Fundamenta Informaticae
Multiset-Based Self-Assembly of Graphs
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Subword Balance in BinaryWords, Languages and Sequences
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
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
A Possible Connection Between Two Theories: Grammar Systems and Concurrent Programming
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Monocultures and Homogeneous Environment in Eco-Grammar Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Connecting partial words and regular languages
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
On Some Problems of Mateescu Concerning Subword Occurrences
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On the Injectivity of Parikh Matrix Mappings
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)
Recursive Calculus with Membranes
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
On the Injectivity of the Parikh Matrix Mapping
Fundamenta Informaticae
On Variants of Communicating Distributed H Systems
Fundamenta Informaticae
Membrane Computing with External Output
Fundamenta Informaticae
Dynamical Teams in Eco-Grammar Systems
Fundamenta Informaticae
Fundamenta Informaticae
On Synchronization in P Systems
Fundamenta Informaticae
Asynchronous spiking neural P systems with local synchronization
Information Sciences: an International Journal
P systems with adjoining controlled communication rules
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
The simplest language where equivalence of finite substitutions is undecidable
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Maximal and minimal scattered context rewriting
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
The sequence equivalence problem for primitive D0L systems
Journal of Computer and System Sciences
On properties and state complexity of deterministic state-partition automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Morphic characterizations with insertion systems controlled by a context of length one
Theoretical Computer Science
Observer/Interpreter p systems
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Fast hardware implementations of p systems
CMC'12 Proceedings of the 13th international conference on Membrane Computing
EvoMUSART'13 Proceedings of the Second international conference on Evolutionary and Biologically Inspired Music, Sound, Art and Design
Fuzzy reasoning spiking neural P system for fault diagnosis
Information Sciences: an International Journal
Reversible spiking neural P systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Universality of sequential spiking neural P systems based on minimum spike number
Theoretical Computer Science
Note: One-sided random context grammars with a limited number of right random context rules
Theoretical Computer Science
DNA-algorithm for timetable problem
International Journal of Bioinformatics Research and Applications
Spiking neural P systems with rules on synapses
Theoretical Computer Science
Regular languages of partial words
Information Sciences: an International Journal
| Hi-index | 0.06 |