The ω sequence problem for DOL systems is decidable
Journal of the ACM (JACM)
Computing on an anonymous ring
Journal of the ACM (JACM)
Journal of the ACM (JACM)
An application of L systems to local microcode synthesis
MICRO 23 Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture
An algorithm to symbolically describe flows on surfaces
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The expressibility of languages and relations by word equations
Journal of the ACM (JACM)
Development models of herbaceous plants for computer imagery purposes
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Theoretical Computer Science
Gene assembly in ciliates: computing by folding and recombination
A half-century of automata theory
Operations and language generating devices suggested by the genome evolution
Theoretical Computer Science
Decidability of EDT0L structural equivalence
Theoretical Computer Science
An algebraic characterization of the set of succession rules
Theoretical Computer Science
Uni-transitional Watson-Crick DOL systems
Theoretical Computer Science
Koch Curves as Attractors and Repellers
IEEE Computer Graphics and Applications
Topics in the theory of DNA computing
Theoretical Computer Science - Natural computing
Theoretical Computer Science - Natural computing
Some analytic features of algebraic data
Discrete Applied Mathematics
Universal computation with Watson-Crick DOL systems
Theoretical Computer Science
Automatic Graphs and Graph D0L-Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Delta Operation: From Strings to Trees to Strings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
DNA Computing: New Ideas and Paradigms
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Effective Lossy Queue Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Some Remarks on Networks of Parallel Language Processors
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
An L-System-Based Plant Modeling Language
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
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
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Tissue P Systems with Contextual and Rewriting Rules
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
Parallel Rewriting P Systems with Deadlock
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
New Small Universal Circular Post Machines
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
D0L System + Watson-Crick Complementarity = Universal Computation
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
Languages, D0L-systems, sets of curves, and surface automorphisms
Information and Computation
The delta operation: from strings to trees to strings
Formal and natural computing
Theoretical Computer Science
Power and size of extended Watson--Crick Lsystems
Theoretical Computer Science
On images of DOL and DTOL power series
Theoretical Computer Science
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
The &ohgr;-sequence equivalence problem for DOL systems is decidable
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Watson--Crick D0L systems: the power of one transition
Theoretical Computer Science
On three variants of rewriting P systems
Theoretical Computer Science
Decidability results for Watson--Crick D0L systems with nonregular triggers
Theoretical Computer Science
On D0L systems with finite axiom sets
Acta Cybernetica
Table-driven and context-sensitive collage languages
Journal of Automata, Languages and Combinatorics
Journal of Automata, Languages and Combinatorics
Remarks on simple eco-grammar systems with prescribed teams
Journal of Automata, Languages and Combinatorics
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
Automatic graphs and D0L-sequences of finite graphs
Journal of Computer and System Sciences
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c
Information and Computation
Contextual grammars as generative models of natural languages
Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Bounds for the D0L language equivalence problem
Information and Computation
Implementation experience with collision avoidance in signing avatars
AFRIGRAPH '04 Proceedings of the 3rd international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
On the power of membrane division in P systems
Theoretical Computer Science - Words, languages and combinatorics
Hierarchies of parallel rewriting P systems: a survey
New Generation Computing - Membrane computing
On the number of components in cooperating distributed grammar systems
Theoretical Computer Science - Descriptional complexity of formal systems
The language equivalence problem for HD0L systems having D0L growths
Theoretical Computer Science - Insightful theory
Explicit test sets for iterated morphisms in free monoids and metabelian groups
Theoretical Computer Science - Insightful theory
The class of HDTOL sequences is closed with respect to rational functions
Information Processing Letters
The generative capacity of block-synchronized context-free grammars
Theoretical Computer Science
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
Length synchronization context-free grammars
Journal of Automata, Languages and Combinatorics
Theoretical Computer Science
Dynamical Teams in Eco-Grammar Systems
Fundamenta Informaticae
Valences in Lindenmayer Systems
Fundamenta Informaticae
Remarks on arbitrary multiple pattern interpretations
Information Processing Letters
On the Problem Whether the Image of an N-Rational Series Equals
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Membrane Computing and Economics: Numerical P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Subword Balance in BinaryWords, Languages and Sequences
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
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
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
The finiteness of synchronous, tabled picture languages is decidable
Theoretical Computer Science
Iterated sequential transducers as language generating devices
Theoretical Computer Science
An infinite hierarchy induced by depth synchronization
Theoretical Computer Science
Cancellation and periodicity properties of iterated morphisms
Theoretical Computer Science
International Journal of Computer Mathematics - Celebrating the Life of David J. Evans
The many facets of natural computing
Communications of the ACM
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
Information and Computation
Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On the Computational Power of Enhanced Mobile Membranes
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The Minimum Substring Cover problem
Information and Computation
Synchronization functions of synchronized context-free grammars and languages
Journal of Automata, Languages and Combinatorics
Journal of Automata, Languages and Combinatorics
On active symbols in CD grammar systems
Journal of Automata, Languages and Combinatorics
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
Multi-agent Simulation of Linguistic Processes: A NEPs Perspective
Agent Computing and Multi-Agent Systems
The equality problem for infinite words generated by primitive morphisms
Information and Computation
Array P Systems and t.Communication
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Two collapsing hierarchies of subregularly tree controlled languages
Theoretical Computer Science
On the synchronized derivation depth of context-free grammars
Theoretical Computer Science
A powerful abelian square-free substitution over 4 letters
Theoretical Computer Science
Turing Completeness Using Three Mobile Membranes
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Pure 2D picture grammars and languages
Discrete Applied Mathematics
The class of HDT0L sequences is closed with respect to rational functions
Information Processing Letters
On the descriptional complexity of some variants of lindenmayer systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Flip-pushdown automata: nondeterminism is better than determinism
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Flip-pushdown automata: k + 1 pushdown reversals are better than k
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The minimum substring cover problem
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Pure 2D picture grammars (P2DPG) and P2DPG with regular control
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Christoffel and Fibonacci tiles
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Subword balance, position indices and power sums
Journal of Computer and System Sciences
Automatic reconstruction of tree skeletal structures from point clouds
ACM SIGGRAPH Asia 2010 papers
An efficient derivation method for DTOL systems and a measure of derivation complexity
Journal of Automata, Languages and Combinatorics
Dynamic substructure method for elastic fractal structures
Computers and Structures
Decidability of operation problems for T0L languages and subclasses
Information and Computation
Limited simple eco-grammar systems with prescribed teams
Journal of Automata, Languages and Combinatorics
Rainbow of computer science
On some biologically motivated control devices for parallel rewriting
Computation, cooperation, and life
Extended Watson-Crick L systems with regular trigger languages
UC'11 Proceedings of the 10th international conference on Unconventional computation
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
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
Modeling dynamical parallelism in bio-systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
May embodiment cause hyper-computation?
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
Computers and Electronics in Agriculture
Non-cooperative p systems with priorities characterize PsET0L
WMC'05 Proceedings of the 6th international conference on Membrane Computing
The lempel-ziv complexity of fixed points of morphisms
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Harmonizations of time with non periodic ordered structures in discrete geometry and astronomy
CMMR'04 Proceedings of the Second international conference on Computer Music Modeling and Retrieval
Modeling neural processes in lindenmayer systems
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
A method for deciding the finiteness of deterministic tabled picture languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Towards bridging two cell-inspired models: P systems and R systems
Theoretical Computer Science
Note: Marked D0L systems and the 2n-conjecture
Theoretical Computer Science
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Bispecial factors in circular non-pushy D0L languages
Theoretical Computer Science
A P system model with pure context-free rules for picture array generation
Mathematical and Computer Modelling: An International Journal
On state sequences defined by reaction systems
Logic and Program Semantics
Trade-Offs Between Time, Space, Cooperation, and Communication Complexity for CD Grammar Systems
Fundamenta Informaticae
The Sequence Equivalence Problem for Marked DT0L Systems
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Array P Systems and t.Communication
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Generalized derivations with synchronized context-free grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Subword Balance in BinaryWords, Languages and Sequences
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
Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
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
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
On the Problem Whether the Image of an N-Rational Series Equals
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Membrane Computing and Economics: Numerical P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Valences in Lindenmayer Systems
Fundamenta Informaticae
Membrane Computing with External Output
Fundamenta Informaticae
Dynamical Teams in Eco-Grammar Systems
Fundamenta Informaticae
Solving Equivalence of Recurrent Sequences in Groups by Polynomial Manipulation
Fundamenta Informaticae
The Equivalence Problem of D0L and DF0L Power Series
Fundamenta Informaticae
On Accepting Pure Lindenmayer Systems
Fundamenta Informaticae
Decision Problems Concerning a Power Series Generalization of DTOL Systems
Fundamenta Informaticae
ON A POWER SERIES GENERALIZATION OF ETOL LANGUAGES
Fundamenta Informaticae
TWO LOWER BOUNDS ON DISTRIBUTIVE GENERATION OF LANGUAGES
Fundamenta Informaticae
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
CONTEXTUAL GRAMMARS: PARALLELISM AND BLOCKING OF DERIVATION
Fundamenta Informaticae
SOME UNDECIDABILITY RESULTS CONCERNING k-LIMITED 0L SYSTEMS
Fundamenta Informaticae
On The Generative Capacity Of Certain Classes Of Cooperating Grammar Systems
Fundamenta Informaticae
A Characterization of Regular Languages as Equality Sets of HDT0L Sequences
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
The sequence equivalence problem for primitive D0L systems
Journal of Computer and System Sciences
Functions and sequences generated by reaction systems
Theoretical Computer Science
Systematic engineering of control protocols for covert channels
CMS'12 Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
Extended Watson---Crick L systems with regular trigger languages and restricted derivation modes
Natural Computing: an international journal
Turing's three pioneering initiatives and their interplays
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Analyzing growing plants from 4D point cloud data
ACM Transactions on Graphics (TOG)
Left Random Context ET0L Grammars
Fundamenta Informaticae
| Hi-index | 0.04 |