Lila Kari

Bioinform., September, 2023

BarcodeBERT: Transformers for Biodiversity Analysis.

[BibT_eX]

[DOI]

Joakim Bruslund Haurum

CoRR, 2023

2022

Primitivity of Atom Watson-Crick Fibonacci Words.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2022

Watson-Crick Powers of a Word.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 9th International Conference, 2022

2021

A fascinating rainbow of computation - Honoring Gheorghe Păun on the occasion of his 70th birthday.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Building bridges - Honoring Nataša Jonoska on the occasion of her 60th birthday.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Conjugate word blending: formal model and experimental implementation by XPCR.

[BibT_eX]

[DOI]

Nat. Comput., 2021

Involutive Fibonacci Words.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2021

Descriptional Complexity of Semi-Simple Splicing Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

2020

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

State Complexity of Overlap Assembly.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

Word Blending in Formal Languages.

[BibT_eX]

[DOI]

Zihao Wang

Fundam. Informaticae, 2020

MLDSP-GUI: an alignment-free standalone tool with an interactive graphical user interface for DNA sequence comparison and analysis.

[BibT_eX]

[DOI]

Gurjit S. Randhawa

Kathleen A. Hill

Bioinform., 2020

2019

Editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Simplifying the role of signals in tile self-assembly.

[BibT_eX]

[DOI]

Amirhossein Simjour

Nat. Comput., 2019

State Complexity of Pseudocatenation.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2019

State Complexity of Simple Splicing.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Relative Watson-Crick Primitivity of Words.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

Transducer descriptions of DNA code properties and undecidability of antimorphic problems.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers.

[BibT_eX]

[DOI]

Meng Yang

Algorithms, 2018

Word Blending in Formal Languages: The Brangelina Effect.

[BibT_eX]

[DOI]

Zihao Wang

Proceedings of the Unconventional Computation and Natural Computation, 2018

2017

On the overlap assembly of strings and languages.

[BibT_eX]

[DOI]

Nat. Comput., 2017

Deciding whether a regular language is generated by a splicing system.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Further remarks on DNA overlap assembly.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Smart Tile Self-Assembly and Replication.

[BibT_eX]

[DOI]

Amirhossein Simjour

Fundam. Informaticae, 2017

MoDMaps3D: an interactive webtool for the quantification and 3D visualization of interrelationships in a dataset of DNA sequences.

[BibT_eX]

[DOI]

Rallis Karamichalis

Bioinform., 2017

Binary Pattern Tile Set Synthesis Is NP-Hard.

[BibT_eX]

[DOI]

Pierre-Étienne Meunier

Matthew J. Patitz

Algorithmica, 2017

Disjunctivity and other properties of sets of pseudo-bordered words.

[BibT_eX]

[DOI]

Acta Informatica, 2017

2016

Preface.

[BibT_eX]

[DOI]

Nat. Comput., 2016

Additive methods for genomic signatures.

[BibT_eX]

[DOI]

Rallis Karamichalis

Stephen Solis-Reyes

BMC Bioinform., 2016

2015

TCS in the 21st century.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

3-color bounded patterned self-assembly.

[BibT_eX]

[DOI]

Nat. Comput., 2015

A Formal Language Model of DNA Polymerase Enzymatic Activity.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

An investigation into inter- and intragenomic variations of graphic genomic signatures.

[BibT_eX]

[DOI]

Rallis Karamichalis

BMC Bioinform., 2015

Methods for Relativizing Properties of Codes.

[BibT_eX]

[DOI]

Helmut Jürgensen

Acta Cybern., 2015

2014

On the maximality of languages with combined types of code properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Generating the Pseudo-Powers of a Word.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

Hypergraph Automata: a Theoretical Model for patterned Self-assembly.

[BibT_eX]

[DOI]

Amirhossein Simjour

Int. J. Found. Comput. Sci., 2014

An efficient algorithm for computing the edit distance of a regular language via input-altering transducers.

[BibT_eX]

[DOI]

Meng Yang

CoRR, 2014

Pseudo-Identities and Bordered Words.

[BibT_eX]

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

The Power of Nondeterminism in Self-Assembly.

[BibT_eX]

[DOI]

Theory Comput., 2013

State complexity of star of union and square of union on k regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Map of Life: Measuring and Visualizing Species' Relatedness with "Molecular Distance Maps".

[BibT_eX]

[DOI]

CoRR, 2013

Negative Interactions in Irreversible Self-assembly.

[BibT_eX]

[DOI]

David Doty

Benoît Masson

Algorithmica, 2013

3-Color Bounded Patterned Self-assembly - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 19th International Conference, 2013

Negative Glues and Non-determinism in Nanocomputations by Self-assembly.

[BibT_eX]

[DOI]

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

DNA Computing - Foundations and Implications.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Natural Computing, 2012

State complexity of union and intersection of square and reversal on k regular languages.

[BibT_eX]

[DOI]

Sheng Yu

Theor. Comput. Sci., 2012

State complexity of union and intersection of star on k regular languages.

[BibT_eX]

[DOI]

Sheng Yu

Theor. Comput. Sci., 2012

Relativized codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

State complexity of combined operations with two basic operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

One-reversal counter machines and multihead automata: Revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

De Bruijn Sequences Revisited.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Pseudopower Avoidance.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

Fundam. Informaticae, 2012

Iterated Hairpin Completions of Non-crossing Words.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

State Complexity of Star and Square of Union of k Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2012

Triangular and Hexagonal Tile Self-assembly Systems.

[BibT_eX]

[DOI]

Proceedings of the Computation, Physics and Beyond, 2012

2011

Polyominoes simulating arbitrary-neighborhood zippers and tilings.

[BibT_eX]

[DOI]

Benoît Masson

Theor. Comput. Sci., 2011

Block insertion and deletion on trajectories.

[BibT_eX]

[DOI]

Bo Cui

Theor. Comput. Sci., 2011

Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies.

[BibT_eX]

[DOI]

Eugen Czeizler

Nat. Comput., 2011

Schema for Parallel Insertion and Deletion: Revisited.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Properties of Pseudo-Primitive Words and their Applications.

[BibT_eX]

[DOI]

Benoît Masson

Int. J. Found. Comput. Sci., 2011

Orthogonal Shuffle on Trajectories.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

An extension of the Lyndon-Schützenberger result to pseudoperiodic words.

[BibT_eX]

[DOI]

Inf. Comput., 2011

On the Regularity of Iterated Hairpin Completion of a Single Word.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

K-Comma Codes and Their Generalizations.

[BibT_eX]

[DOI]

Bo Cui

Fundam. Informaticae, 2011

Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Deciding if a Regular Language is Generated by a Splicing System

[BibT_eX]

[DOI]

CoRR, 2011

2010

On a special class of primitive words.

[BibT_eX]

[DOI]

Elena Czeizler

Theor. Comput. Sci., 2010

Watson-Crick palindromes in DNA computing.

[BibT_eX]

[DOI]

Nat. Comput., 2010

An Improved Bound for an Extension of Fine and Wilf's Theorem and Its Optimality.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Ciliate Gene Unscrambling with Fewer Templates

[BibT_eX]

[DOI]

Afroza Rahman

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

State Complexity of Catenation Combined with Star and Reversal

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation

[BibT_eX]

[DOI]

CoRR, 2010

Triangular Self-Assembly

[BibT_eX]

[DOI]

CoRR, 2010

State Complexity of Catenation Combined with Union and Intersection.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

Triangular Tile Self-assembly Systems.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

Schema for Parallel Insertion and Deletion.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

DNA Computing and Its Implications for Theoretical Computer Science.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Pseudo-power Avoidance.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

Twin-roots of words and their properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the descriptional complexity of Watson-Crick automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

On pseudoknot-bordered words and their properties.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Geometrical tile design for complex neighborhoods.

[BibT_eX]

[DOI]

Eugen Czeizler

Frontiers Comput. Neurosci., 2009

On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes.

[BibT_eX]

[DOI]

Bo Cui

Proceedings of the Algebraic Informatics, Third International Conference, 2009

Duplication in DNA Sequences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Bioprocesses, 2009

2008

On the weight of universal insertion grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Watson-Crick Bordered Words and their Syntactic Monoid.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Involution Solid and Join codes.

[BibT_eX]

[DOI]

Natasa Jonoska

Fundam. Informaticae, 2008

The many facets of natural computing.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Commun. ACM, 2008

Watson-Crick automata: determinism and state complexity.

[BibT_eX]

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

Involutively Bordered Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

The syntactic monoid of hairpin-free languages.

[BibT_eX]

[DOI]

Acta Informatica, 2007

Nanocomputing by Self-assembly.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation, 6th International Conference, 2007

Towards the Sequence Design Preventing Pseudoknot Formation.

[BibT_eX]

[DOI]

Proceedings of the Natural Computing, 2007

Watson-Crick Conjugate and Commutative Words.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006

A Formal Language Analysis of DNA Hairpin Structures.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Block Substitutions and Their Properties.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Involution Solid Codes.

[BibT_eX]

[DOI]

Proceedings of the Nanotechnology: Science and Computation, 2006

DNA Codes and Their Properties.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005

Aspects of shuffle and deletion on trajectories.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On properties of bond-free DNA languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Computationally universal P systems without priorities: two catalysts are sufficient.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Language equations, maximality and error-detection.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Bond-free languages: formalizations, maximality and construction methods.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Operations on trajectories with applications to coding and bioinformatics.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Results on Transforming NFA into DFCA.

[BibT_eX]

[DOI]

Cezar Câmpeanu

Andrei Paun

Fundam. Informaticae, 2005

Who Counts Your Votes?

[BibT_eX]

[DOI]

Halina Kaminski

Mark Perry

Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce, and e-Services (EEE 2005), 29 March, 2005

Hairpin Structures in DNA Words.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

On Hairpin-Free Words and Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

Families of languages defined by ciliate bio-operations.

[BibT_eX]

[DOI]

Mark Daley

Ian McQuillan

Theor. Comput. Sci., 2004

Descriptional Complexity of Error/Edit Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

On Language Equations with Deletion.

[BibT_eX]

Bull. EATCS, 2004

Substitutions, Trajectories and Noisy Channels.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

Preventing Undesirable Bonds Between DNA Codewords.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

On the Universality of P Systems with Minimal Symport/Antiport Rules.

[BibT_eX]

[DOI]

Carlos Martín-Vide

Andrei Paun

Proceedings of the Aspects of Molecular Computing, 2004

Substitution on Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

Biocomputation in Ciliates.

[BibT_eX]

Laura F. Landweber

Proceedings of the Cellular Computing., 2004

2003

Coding properties of DNA languages.

[BibT_eX]

[DOI]

Salah Hussini

Theor. Comput. Sci., 2003

Closure and decidability properties of some language classes with respect to ciliate bio-operations.

[BibT_eX]

[DOI]

Mark Daley

Theor. Comput. Sci., 2003

The LD and DLAD Bio-Operations on Formal Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

Sticky-free and overhang-free DNA languages.

[BibT_eX]

[DOI]

Geoff Wozniak

Acta Informatica, 2003

2002

On the Decidability of Self-Assembly of Infinite Ribbons.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Some Properties of Ciliate Bio-operations.

[BibT_eX]

[DOI]

Mark Daley

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Codes, Involutions, and DNA Encodings.

[BibT_eX]

[DOI]

Rob Kitto

Proceedings of the Formal and Natural Computing, 2002

2001

A computer scientist's guide to molecular biology.

[BibT_eX]

[DOI]

Rob Kitto

Greg Gloor

Soft Comput., 2001

Morphisms preserving densities.

[BibT_eX]

[DOI]

Helmut Jürgensen

Int. J. Comput. Math., 2001

DNA computing in vitro and in vivo.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2001

String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation.

[BibT_eX]

Andrei Paun

Proceedings of the Words, Semigroups, and Transductions, 2001

Context-free recombinations.

[BibT_eX]

Proceedings of the Where Mathematics, 2001

DNA Computers: Tomorrow's Reality.

[BibT_eX]

Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000

Using DNA to solve the Bounded Post Correspondence Problem.

[BibT_eX]

[DOI]

Greg Gloor

Sheng Yu

Theor. Comput. Sci., 2000

Shuffle and scattered deletion closure of languages.

[BibT_eX]

[DOI]

Masami Ito

Theor. Comput. Sci., 2000

Half century of automata theory.

[BibT_eX]

[DOI]

SIGACT News, 2000

1999

DNA Computing Based on Splicing: The Existence of Universal Computers.

[BibT_eX]

[DOI]

Rudolf Freund

Theory Comput. Syst., 1999

Towards a DNA Solution to the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 1999

Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Bringing PC Grammar Systems Closer to Hoare's CSPs.

[BibT_eX]

Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

How to Compute with DNA.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Computational power of gene rearrangement.

[BibT_eX]

[DOI]

Laura F. Landweber

Proceedings of the DNA Based Computers, 1999

Reversible Molecular Computation in Ciliates.

[BibT_eX]

Laura F. Landweber

Proceedings of the Jewels are Forever, 1999

1998

DNA Computing, Sticker Systems, and Universality.

[BibT_eX]

[DOI]

Acta Informatica, 1998

1997

L Systems.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

Insertion and Deletion Closure of Languages.

[BibT_eX]

[DOI]

Masami Ito

Theor. Comput. Sci., 1997

At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems.

[BibT_eX]

[DOI]

Proceedings of the DNA Based Computers, 1997

From Micro-Soft to Bio-Soft: Computing With DNA.

[BibT_eX]

Proceedings of the Biocomputing and emergent computation: Proceedings of BCEC97, 1997

1996

The Power of Restricted Splicing with Rules from a Regular Language.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1996

Maximal and Minimal Solutions to Language Equations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Omega-Syntactic Congruences.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1996

Contextual Insertions/Deletions and Computability.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Two Lower Bounds on Distributive Generation of Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Test Tube Distributed Systems Based on Splicing.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

Comput. Artif. Intell., 1996

1995

Multi-Pattern Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Teams in cooperating grammar systems.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 1995

On Parallel Deletions Applied to a Word.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Generalised DOL Trees.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Acta Cybern., 1995

Morphisms and Associated Congruences.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1994

On Language Equations with Invertible Operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.

[BibT_eX]

[DOI]

Juraj Hromkovic

Theor. Comput. Sci., 1994

Subapical Bracketed L-Systems.

[BibT_eX]

[DOI]

Przemyslaw Prusinkiewicz

Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Power of Controlled Insertion and Deletion.

[BibT_eX]

[DOI]

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Aperiodic Languages and Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993

Parallel Communicating Grammar Systems.

[BibT_eX]

[DOI]

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

In the prehistory of formal language theory: Gauss languages.

[BibT_eX]

[DOI]

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Deletion Sets.

[BibT_eX]

Fundam. Informaticae, 1993

Generalized Derivatives.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1993

Insertion operations: Closure properties.

[BibT_eX]

Bull. EATCS, 1993

Gramars with Oracles.

[BibT_eX]

Sci. Ann. Cuza Univ., 1993

1992

The Impact of the Number of Cooperating Grammars on the Generative Power.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

In the prehistory of formal language theory: Gauss Languages.

[BibT_eX]

Bull. EATCS, 1992

Insertion and Deletion of Words: Determinism and Reversibility.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991

Secret ballot elections in computer networks.

[BibT_eX]

[DOI]

Hannu Nurmi

Comput. Secur., 1991

1990

On a theorem of Günter Asser.

[BibT_eX]

[DOI]

Cristian Calude

Math. Log. Q., 1990

Further remarks on parallel communicating grammar systems.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1990

Parallel Communicating Systems.

[BibT_eX]

Bull. EATCS, 1990

Secret Selling of Secrets with Several Buyers.

[BibT_eX]

Bull. EATCS, 1990

A Hierarchy of Unary Primitive Recursive String-Functions.

[BibT_eX]

[DOI]