Partial words and a theorem of Fine and Wilf revisited
Theoretical Computer Science
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
Upper Bounds for Restricted Splicing
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Splicing Systems: Regularity and Below
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Upper bounds for restricted splicing
Formal and natural computing
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)
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Linear and circular splicing systems
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
The maximum state complexity for finite languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Discrete Applied Mathematics
Complexity theory for splicing 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
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Complexity theory for splicing systems
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Theoretical Computer Science
Accepting networks of splicing processors with filtered connections
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
DNA splicing systems: an ordinary differential equations model and simulation
DNA13'07 Proceedings of the 13th international conference on DNA computing
Regular splicing languages must have a constant
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Splicing systems: accepting versus generating
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Solving SAT and HPP with accepting splicing systems
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Splicing systems for universal turing machines
DNA'04 Proceedings of the 10th international conference on DNA computing
A decision procedure for reflexive regular splicing languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Recombinant DNA ,gene splicing as generative devices of formal languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Controlled H Systems and Chomsky Hierarchy
Fundamenta Informaticae
Controlled H Systems of Small Radius
Fundamenta Informaticae
| Hi-index | 0.06 |