| Publication | Date of Publication | Type |
|---|
On approximately identifying concept classes in the limit
Lecture Notes in Computer Science | 2023-12-08 | Paper |
\(\mathcal{L}\)-reduction computation revisited
Acta Informatica | 2022-08-30 | Paper |
Corrigendum to: ``On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
Theoretical Computer Science | 2022-05-17 | Paper |
Theory of reaction automata: a survey
Journal of Membrane Computing | 2021-09-14 | Paper |
On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
Theoretical Computer Science | 2021-03-09 | Paper |
The computing power of determinism and reversibility in chemical reaction automata
Reversibility and Universality | 2020-05-28 | Paper |
The computational capability of chemical reaction automata
Natural Computing | 2019-07-10 | Paper |
Decomposition and factorization of chemical reaction transducers
Theoretical Computer Science | 2019-06-18 | Paper |
Computing with multisets: a survey on reaction automata theory
| 2018-09-06 | Paper |
Morphic characterizations of language families based on local and star languages
Fundamenta Informaticae | 2018-01-19 | Paper |
Finite automata with multiset memory: a new characterization of Chomsky hierarchy
Fundamenta Informaticae | 2016-05-11 | Paper |
A simple classification of the volvocine algae by formal languages
Bulletin of Mathematical Biology | 2016-04-05 | Paper |
Hairpin languages
International Journal of Foundations of Computer Science | 2015-04-30 | Paper |
The computational capability of chemical reaction automata
Lecture Notes in Computer Science | 2014-10-08 | Paper |
On the properties of language classes defined by bounded reaction automata
Theoretical Computer Science | 2012-10-11 | Paper |
Reaction automata
Theoretical Computer Science | 2012-05-30 | Paper |
Spiking neural dP systems
| 2012-03-22 | Paper |
On the hairpin incompletion
Fundamenta Informaticae | 2011-11-22 | Paper |
Morphic characterizations of language families in terms of insertion systems and star languages
International Journal of Foundations of Computer Science | 2011-02-23 | Paper |
Some remarks on the hairpin completion
International Journal of Foundations of Computer Science | 2010-11-11 | Paper |
On spiking neural P systems
Natural Computing | 2010-09-16 | Paper |
Aspects of Molecular Computing
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity
DNA Computing | 2009-04-02 | Paper |
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science | 2009-03-02 | Paper |
REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity
Natural Computing | 2008-05-20 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Spiking neural P systems
| 2006-08-03 | Paper |
scientific article; zbMATH DE number 2150298 (Why is no real title available?)
| 2005-03-30 | Paper |
On the power of membrane division in P systems
Theoretical Computer Science | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2087507 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2077185 (Why is no real title available?)
| 2004-07-01 | Paper |
scientific article; zbMATH DE number 2077175 (Why is no real title available?)
| 2004-07-01 | Paper |
On the computational power of insertion-deletion systems
Natural Computing | 2004-03-15 | Paper |
scientific article; zbMATH DE number 1953225 (Why is no real title available?)
| 2003-07-25 | Paper |
Polynomial-time identification of very simple grammars from positive data.
Theoretical Computer Science | 2003-05-22 | Paper |
Molecular computing paradigm -- toward freedom from Turing's charm
Natural Computing | 2003-05-04 | Paper |
scientific article; zbMATH DE number 1870553 (Why is no real title available?)
| 2003-02-18 | Paper |
Corrigendum. Learning two-tape automata from queries and counterexamples
Theory of Computing Systems | 2002-12-01 | Paper |
scientific article; zbMATH DE number 1836430 (Why is no real title available?)
| 2002-11-27 | Paper |
Toward soft hardware
Soft Computing | 2002-07-25 | Paper |
scientific article; zbMATH DE number 1568811 (Why is no real title available?)
| 2001-06-21 | Paper |
scientific article; zbMATH DE number 1568806 (Why is no real title available?)
| 2001-06-21 | Paper |
scientific article; zbMATH DE number 1543347 (Why is no real title available?)
| 2001-02-27 | Paper |
Computation = self-assembly + conformational change: Toward new computing paradigms.
| 2000-01-01 | Paper |
scientific article; zbMATH DE number 1351086 (Why is no real title available?)
| 1999-10-24 | Paper |
scientific article; zbMATH DE number 1342114 (Why is no real title available?)
| 1999-09-22 | Paper |
scientific article; zbMATH DE number 1301791 (Why is no real title available?)
| 1999-06-16 | Paper |
Tree adjoining grammars for RNA structure prediction
Theoretical Computer Science | 1999-01-12 | Paper |
Learning approximately regular languages with reversible languages
Theoretical Computer Science | 1998-10-22 | Paper |
scientific article; zbMATH DE number 1104343 (Why is no real title available?)
| 1998-09-08 | Paper |
scientific article; zbMATH DE number 996379 (Why is no real title available?)
| 1997-10-22 | Paper |
FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
International Journal of Foundations of Computer Science | 1997-08-07 | Paper |
Learning two-tape automata from queries and counterexamples
Mathematical Systems Theory | 1996-05-27 | Paper |
On polynomial-time learnability in the limit of strictly deterministic automata
Machine Learning | 1996-02-13 | Paper |
scientific article; zbMATH DE number 176928 (Why is no real title available?)
| 1993-05-18 | Paper |
Inductive inference of context-free languages based on context-free expressions
International Journal of Computer Mathematics | 1988-01-01 | Paper |
Set abstraction - an extension of all solutions predicate in logic programming language
New Generation Computing | 1987-01-01 | Paper |
On purely morphic characterizations of context-free languages
Theoretical Computer Science | 1987-01-01 | Paper |
Logic program forms
New Generation Computing | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4028939 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3943036 (Why is no real title available?)
| 1986-01-01 | Paper |
Erratum to: ``A three-restricted normal form theorem for ETOL languages
Information Processing Letters | 1985-01-01 | Paper |
An inverse homomorphic characterization of full principal AFL
Information Sciences | 1984-01-01 | Paper |
Semi-linearity, Parikh-boundedness and tree adjunct languages
Information Processing Letters | 1983-01-01 | Paper |
A three-restricted normal form theorem for ETOL languages
Information Processing Letters | 1982-01-01 | Paper |
Stochastic characterizations of E0L languages
Information and Control | 1980-01-01 | Paper |
