Arto Salomaa

Magnus Steinby

Int. J. Found. Comput. Sci., 2024

2023

Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) - Preface.

[BibT_eX]

[DOI]

Manfred Droste

George Rahonis

Int. J. Found. Comput. Sci., September, 2023

Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude).

[BibT_eX]

[DOI]

Theor. Comput. Sci., March, 2023

Descriptional Complexity of Finite Automata - Selected Highlights.

[BibT_eX]

[DOI]

Taylor J. Smith

CoRR, 2023

2021

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2020

Preface of the special issue for Gheorghe Pǎun's 70th anniversary.

[BibT_eX]

[DOI]

Marian Gheorghe

Mario J. Pérez-Jiménez

J. Membr. Comput., 2020

2018

From Infinite to Finite by Identifying Variables in Many-Valued Logic.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

Parikh Matrices: Subword Indicators and Degrees of Ambiguity.

[BibT_eX]

[DOI]

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Minimal reaction systems: Duration and blips.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

From finite state grammars to natural computing - In memory of Solomon Marcus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Ambiguity, Nondeterminism and State Complexity of Finite Automata.

[BibT_eX]

[DOI]

Yo-Sub Han

Acta Cybern., 2017

Depth of Closed Classes of Truth Functions in Many-Valued Logic.

[BibT_eX]

[DOI]

Proceedings of the Role of Theory in Computer Science, 2017

2015

Applications of the Chinese remainder theorem to reaction systems with duration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Alberto Apostolico.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Two-Step Simulations of Reaction Systems by Minimal Ones.

[BibT_eX]

[DOI]

Acta Cybern., 2015

2014

Compositions of Reaction Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

Wilfried Brauer (1937-2014) in memoriam.

[BibT_eX]

[DOI]

Bull. EATCS, 2014

Minimal Reaction Systems Defining Subset Functions.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

On Axiomatizations of General Many-Valued Propositional Calculi.

[BibT_eX]

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

2013

Minimal and almost minimal reaction systems.

[BibT_eX]

[DOI]

Nat. Comput., 2013

Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012.

[BibT_eX]

[DOI]

Andrew L. Szilard

Int. J. Found. Comput. Sci., 2013

Functional Constructions between reaction Systems and Propositional Logic.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Undecidability of state complexity.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

2012

Functions and sequences generated by reaction systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Preface.

[BibT_eX]

[DOI]

Giorgio Ausiello

Hendrik Jan Hoogeboom

Juhani Karhumäki

Ion Petre

Theor. Comput. Sci., 2012

Sheng Yu.

[BibT_eX]

[DOI]

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

Sheng Yu (1950-2012) In Memoriam.

[BibT_eX]

[DOI]

Andrew L. Szilard

Fundam. Informaticae, 2012

Mirror Images and Schemes for the Maximal Complexity of Nondeterminism.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

In Memoriam Sheng Yu (1950-2012).

[BibT_eX]

[DOI]

Bull. EATCS, 2012

Undecidability of State Complexities Using Mirror Images.

[BibT_eX]

[DOI]

Proceedings of the Languages Alive, 2012

On State Sequences Defined by Reaction Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic and Program Semantics, 2012

Composition Sequences and Synchronizing Automata.

[BibT_eX]

[DOI]

Proceedings of the Computation, Physics and Beyond, 2012

2011

Power Sums Associated with Certain Recursive Procedures on Words.

[BibT_eX]

[DOI]

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

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Undecidability of the State Complexity of Composed Regular Operations.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

On Some Biologically Motivated Control Devices for Parallel Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Computation, 2011

2010

Criteria for the matrix equivalence of words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2010

Seventy Years Derick Wood.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2010

Subword balance, position indices and power sums.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Subword Occurrences, Parikh Matrices and Lyndon Images.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

2009

Variants of codes and indecomposable languages.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Grzegorz Rozenberg: A Magical Scientist and Brother.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Bioprocesses, 2009

Characteristic Words for Parikh Matrices.

[BibT_eX]

Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008

Subword histories and associated matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

State complexity of basic language operations combined with reversal.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Length Codes, Products of Languages and Primality.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

2007

State complexity of combined operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the existence of prime decompositions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Comparing Subword Occurrences in Binary D0L Sequences.

[BibT_eX]

[DOI]

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

Spiking Neural P Systems: an Early Survey.

[BibT_eX]

[DOI]

Mario J. Pérez-Jiménez

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

Subword Balance in BinaryWords, Languages and Sequences.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

State Complexity of Basic Operations Combined with Reversal.

[BibT_eX]

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

On Languages Defined by Numerical Parameters.

[BibT_eX]

[DOI]

Proceedings of the Formal Models, 2007

2006

Independence of certain quantities indicating subword occurrences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Subword conditions and subword histories.

[BibT_eX]

[DOI]

Inf. Comput., 2006

On Some Problems of Mateescu Concerning Subword Occurrences.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Secret Sharing Schemes with Nice Access Structures.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

2005

Connections between subwords and certain matrix mappings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On the Injectivity of Parikh Matrix Mappings.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

2004

On the state complexity of reversals of regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Subword histories and Parikh matrices.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Matrix Indicators For Subword Occurrences And Ambiguity.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

The Power of Networks of Watson-Crick D0L Systems.

[BibT_eX]

[DOI]

Proceedings of the Aspects of Molecular Computing, 2004

2003

Watson-Crick D0L systems: the power of one transition.

[BibT_eX]

[DOI]

Petr Sosík

Theor. Comput. Sci., 2003

Composition sequences for functions over a finite domain.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Power and size of extended Watson-Crick L systems.

[BibT_eX]

[DOI]

Judit Csima

Theor. Comput. Sci., 2003

Cartesian authentication codes from functions with optimal nonlinearity.

[BibT_eX]

[DOI]

Samuel T. Chanson

Theor. Comput. Sci., 2003

From Watson-Crick L systems to Darwinian P systems.

[BibT_eX]

[DOI]

Carlos Martín-Vide

Nat. Comput., 2003

Counting (scattered) Subwords.

[BibT_eX]

Bull. EATCS, 2003

Three Constructions of Authentication/Secrecy Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2003

2002

Uni-transitional Watson-Crick D0L systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

ICALP, EATCS and Maurice Nivat.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Operations and language generating devices suggested by the genome evolution.

[BibT_eX]

[DOI]

Victor Mitrana

Theor. Comput. Sci., 2002

Topics in the theory of DNA computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Generation of Constants and Synchronization of Finite Automata.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

Some Decision Problems Concerning Semilinearity and Commutation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Factorizations of Languages and Commutativity Conditions.

[BibT_eX]

[DOI]

Acta Cybern., 2002

DNA Complementarity and Paradigms of Computing.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Synchronization of Finite Automata: Contributions to an Old Problem.

[BibT_eX]

[DOI]

Proceedings of the Essence of Computation, Complexity, Analysis, 2002

Nondeterministic Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Formal and Natural Computing, 2002

2001

Language-theoretic aspects of DNA complematarity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Watson-Crick D0L systems with regular triggers.

[BibT_eX]

[DOI]

Juha Honkala

Theor. Comput. Sci., 2001

A sharpening of the Parikh mapping.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2001

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Iterated Morphisms with Complementarity on the DNA Alphabet.

[BibT_eX]

Proceedings of the Words, Semigroups, and Transductions, 2001

Sewing contexts and mildly context-sensitive languages.

[BibT_eX]

Carlos Martín-Vide

Proceedings of the Where Mathematics, 2001

Lindenmayer and DNA: Watson-Crick D0L Systems.

[BibT_eX]

Proceedings of the Current Trends in Theoretical Computer Science, 2001

Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring.

[BibT_eX]

Proceedings of the Current Trends in Theoretical Computer Science, 2001

Simple Words in Equality Sets.

[BibT_eX]

Marjo Lipponen

Proceedings of the Current Trends in Theoretical Computer Science, 2001

Networks of Language Processors: Parallel Communicating Systems.

[BibT_eX]

Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000

A characterization of poly-slender context-free languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

Membrane Computing with External Output.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2000

Depth of Functional Compositions.

[BibT_eX]

Bull. EATCS, 2000

On strongly context-free languages.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

On the Expressiveness of Subset-Sum Representations.

[BibT_eX]

[DOI]

Acta Informatica, 2000

Compositions over a Finite Domain: From Completeness to Synchronizable Automata.

[BibT_eX]

Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

Networks of Watson-Crick D0L Systems.

[BibT_eX]

Proceedings of the International Colloquium on Words, 2000

Algebraic Representations of Regular Array Languages.

[BibT_eX]

[DOI]

Rudolf Freund

Proceedings of the Finite Versus Infinite, 2000

1999

Theoretical Computer Science.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Contexts on trajectories.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1999

Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring.

[BibT_eX]

Bull. EATCS, 1999

Watson-Crick Walks and Roads on DOL Graphs.

[BibT_eX]

[DOI]

Acta Cybern., 1999

DNA Computing: New Ideas and Paradigms.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

Caesar and DNA. Views on Cryptology.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

On the decomposition of finite languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

1998

Shuffle on Trajectories: Syntactic Constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars.

[BibT_eX]

[DOI]

Carlos Martín-Vide

Theor. Comput. Sci., 1998

On Well Quasi Orders of Free Monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

2-Testability and Relabelings Produce Everything.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Language-theoretic aspects of string replication.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1998

Characterizations of re languages starting from internal contextual languages.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1998

Networks of Language Processors: Parallel Communicating Systems.

[BibT_eX]

Bull. EATCS, 1998

Simple Splicing Systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Complementarity versus universality: Keynotes of DNA computing.

[BibT_eX]

[DOI]

Complex., 1998

A comparative overview ofcryptographic voting protocols.

[BibT_eX]

[DOI]

Hannu Nurmi

Ann. Oper. Res., 1998

DNA Computing, Sticker Systems, and Universality.

[BibT_eX]

[DOI]

Acta Informatica, 1998

Shuffle on Trajectories: The Schützenberger Product and Related Operations.

[BibT_eX]

[DOI]

Tero Harju

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

DNA Computing - New Computing Paradigms.

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-03563-4, 1998

1997

Families Generated by Grammars and L Systems.

[BibT_eX]

[DOI]

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

Aspects of Classical Language Theory.

[BibT_eX]

[DOI]

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

Formal Languages: an Introduction and a Synopsis.

[BibT_eX]

[DOI]

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

L Systems.

[BibT_eX]

[DOI]

Lila Kari

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

Grammars with Controlled Derivations.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, 1997

Geometric Transformations on Language Families: The Power of Symmetry.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1997

Pattern Languages Versus Parallel Communicating Grammar Systems.

[BibT_eX]

[DOI]

Sorina Dumitrescu

Int. J. Found. Comput. Sci., 1997

Conjugate Words, Cuts of the Deck and Cryptographic Protocols.

[BibT_eX]

Bull. EATCS, 1997

Lindenmayer and DNA: Watson-Crick D0L Systems.

[BibT_eX]

Bull. EATCS, 1997

TWOPRIME: A Fast Stream Ciphering Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 4th International Workshop, 1997

Watson-Crick finite automata.

[BibT_eX]

[DOI]

Proceedings of the DNA Based Computers, 1997

Syntactic and Semantic Aspects of Parallelism.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

Shuffle-like Operations on omega-words.

[BibT_eX]

[DOI]

George Daniel Mateescu

Proceedings of the New Trends in Formal Languages, 1997

Networks of Parallel Language Processors.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

1996

Computing by Splicing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Slender 0L Languages.

[BibT_eX]

[DOI]

Taishin Y. Nishida

Theor. Comput. Sci., 1996

Pattern Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

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

[BibT_eX]

[DOI]

Lila Kari

J. Univers. Comput. Sci., 1996

Pattern Grammars.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1996

Restricted use of the splicing operation.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1996

Contextual Grammars: Parallelism and Blocking of Derivation.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Conjugate Words, Cuts of the Deck and Cryptographic Protocol.

[BibT_eX]

Bull. EATCS, 1996

Views on Linguistics.

[BibT_eX]

Bull. EATCS, 1996

Simple Words in Equality Sets.

[BibT_eX]

Marjo Lipponen

Bull. EATCS, 1996

On Cooperatively Distributed Ciphering and Hashing.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1996

Growth Functions and Length Sets of Replicating Systems.

[BibT_eX]

[DOI]

Acta Cybern., 1996

On Regular Characterizations of Languages by Grammar Systems.

[BibT_eX]

[DOI]

Acta Cybern., 1996

On Representing RE Languages by One-Sided Internal Contextual Languages.

[BibT_eX]

[DOI]

Acta Cybern., 1996

From DNA Recombination to DNA Computing, Via Formal Languages.

[BibT_eX]

Proceedings of the German Conference on Bioinformatics, 1996

Public Key Cryptography, Second Edition.

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-03269-5, 1996

1995

P, NP and the Post Correspondence Problem

[BibT_eX]

[DOI]

Inf. Comput., September, 1995

Multi-Pattern Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Grammars Based on the Shuffle Operation.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Parikh Prime Words and GO-like Territories.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Conditional Tabled Eco-Grammar Systems.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Teams in cooperating grammar systems.

[BibT_eX]

[DOI]

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

Decision Problems for Patterns.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

On Parallel Deletions Applied to a Word.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Return to Patterns.

[BibT_eX]

Bull. EATCS, 1995

From Parikh vectors to GO territories.

[BibT_eX]

Bull. EATCS, 1995

Thin and Slender Languages.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

Generalised DOL Trees.

[BibT_eX]

[DOI]

Lila Kari

Acta Cybern., 1995

1994

Journal of Universal Computer Science.

[BibT_eX]

[DOI]

Cristian Calude

J. Univers. Comput. Sci., 1994

Finite Degrees of Ambiguity in Pattern Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

Patterns.

[BibT_eX]

Bull. EATCS, 1994

Conducting secret ballot elections in computer networks: Problems and solutions.

[BibT_eX]

[DOI]

Hannu Nurmi

Ann. Oper. Res., 1994

Nondeterminism in Patterns.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Marcus Contextual Grammars: Modularity and Leftmost Derivation.

[BibT_eX]

[DOI]

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

Cornerstones of undecidability.

[BibT_eX]

Prentice Hall International Series in Computer Science, Prentice Hall, ISBN: 978-0-13-297425-7, 1994

1993

L codes and L Systems with immigration.

[BibT_eX]

[DOI]

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

Decidability in Finite Automata.

[BibT_eX]

[DOI]

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

What Emil said about the Post Correspondence Problem.

[BibT_eX]

[DOI]

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

Formal Language Theory.

[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

Closure Properties of Slender Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Language-theoretic problems arising from Richelieu cryptosystems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

PCP-Prime Words and Primality Types.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

On the Union of 0L Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Grammars Based on Patterns.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

Deletion Sets.

[BibT_eX]

Fundam. Informaticae, 1993

Simple Reductions Between D0L Language and Sequence Equivalence Problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Gramars with Oracles.

[BibT_eX]

Sci. Ann. Cuza Univ., 1993

On Simplest Possible Solutions for Post Correspondence Problems.

[BibT_eX]

[DOI]

Acta Informatica, 1993

Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Inclusion is Undecidable for Pattern Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Pattern Languages: Problems of Decidability and Generation.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Contextual Grammars: Erasing, Determinism, One-Side Contexts.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

Algorithmically Coding the Universe.

[BibT_eX]

Cristian Calude

Proceedings of the Developments in Language Theory, 1993

1992

Characterization results about L codes.

[BibT_eX]

[DOI]

Juha Honkala

RAIRO Theor. Informatics Appl., 1992

What Emil said about the Post correspondance problem.

[BibT_eX]

Bull. EATCS, 1992

Decision Problems Concerning the Thinness of DOL Languages.

[BibT_eX]

Bull. EATCS, 1992

In the prehistory of formal language theory: Gauss Languages.

[BibT_eX]

Bull. EATCS, 1992

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure.

[BibT_eX]

[DOI]

Acta Cybern., 1992

1991

A Deterministic Algorithm for Modular Knapsack Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Bounded Delay L Codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Many aspects of formal languages.

[BibT_eX]

[DOI]

Inf. Sci., 1991

Primary Types of Instances of the Post Correspondence Problem.

[BibT_eX]

Bull. EATCS, 1991

L Codes and L Systems with Immigration.

[BibT_eX]

Bull. EATCS, 1991

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Secret ballot elections in computer networks.

[BibT_eX]

[DOI]

Hannu Nurmi

Lila Santean

Comput. Secur., 1991

L Morphisms: Bounded Delay and Regularity of Ambiguity.

[BibT_eX]

[DOI]

Juha Honkala

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Verifying and Recasting Secret Ballots in Computer Networks.

[BibT_eX]

[DOI]

Proceedings of the New Results and New Trends in Computer Science, 1991

1990

Public-Key Cryptography

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 23, Springer, ISBN: 0-387-52831-8, 1990

Secret Selling of Secrets with Several Buyers.

[BibT_eX]

Lila Santean

Bull. EATCS, 1990

Decidability in finite automata.

[BibT_eX]

Bull. EATCS, 1990

Decision problems arising from knapsack transformations.

[BibT_eX]

[DOI]

Acta Cybern., 1990

Formal Languages and Power Series.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Public-Key Cryptosystems and Language Theory.

[BibT_eX]

[DOI]

Proceedings of the A Perspective in Theoretical Computer Science, 1989

The Formal Language Theory Column.

[BibT_eX]

Bull. EATCS, 1989

1988

A Pumping Result for 2-Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

The Formal Language Theory Column.

[BibT_eX]

Juhani Karhumäki

Bull. EATCS, 1988

A public-key cryptosystem based on language theory.

[BibT_eX]

[DOI]

Comput. Secur., 1988

Cryptography and Data Security.

[BibT_eX]

[DOI]

Proceedings of the Machines, 1988

1987

Formal Language Theory Column - Two-way Thue.

[BibT_eX]

Bull. EATCS, 1987

Formal languages.

[BibT_eX]

Computer science classics, Academic Press, ISBN: 978-0-12-615750-5, 1987

1986

Systolic Trellis Automata: Stability, Decidability and Complexity

[BibT_eX]

[DOI]

Jozef Gruska

Inf. Control., December, 1986

On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

On the equivalence of grammars inferred from derivation.

[BibT_eX]

Efim B. Kinber

Bull. EATCS, 1986

Semirings, Automata, Languages

[BibT_eX]

[DOI]

Werner Kuich

EATCS Monographs on Theoretical Computer Science 5, Springer, ISBN: 978-3-642-69959-7, 1986

The book of L.

[BibT_eX]

Springer, ISBN: 978-3-540-16022-9, 1986

1985

Syntactic monoids in the construction of systolic tree automata.

[BibT_eX]

[DOI]

Helmut Jürgensen

Int. J. Parallel Program., 1985

The Ehrenfeucht conjecture: a proof for language theorists.

[BibT_eX]

Bull. EATCS, 1985

1984

Systolic Tree Acceptors.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1984

1983

Ambiguity and Decision Problems Concerning Number Systems

[BibT_eX]

[DOI]

Inf. Control., March, 1983

A Supernormal-Form Theorem for Context-Free Grammars

[BibT_eX]

[DOI]

J. ACM, January, 1983

L Codes and Number Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

On a Family of L Languages Resulting from Systolic Tree Automata.

[BibT_eX]

[DOI]

Jozef Gruska

Theor. Comput. Sci., 1983

1982

On Infinite Words Obtained by Iterating Morphisms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Finitary and Infinitary Interpretations of Languages.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1982

Dense Hierarchies of Grammatical Families.

[BibT_eX]

[DOI]

J. ACM, 1982

A homomorphic characterization of regular languages.

[BibT_eX]

[DOI]

Faith E. Fich

Discret. Appl. Math., 1982

Systolic Automata for VLSI on Balanced Trees.

[BibT_eX]

[DOI]

Jozef Gruska

Acta Informatica, 1982

1981

On Predecessors of Finite Languages

[BibT_eX]

[DOI]

Inf. Control., September, 1981

Uniform Interpretations of Grammar Forms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

Completeness of Context-Free Grammar Forms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

Synchronized EOL Forms Under Uniform Interpretation.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1981

Sub-Regular Grammar Forms.

[BibT_eX]

[DOI]

Thomas Ottmann

Inf. Process. Lett., 1981

Table systems with unconditional transfer.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

Decidability and density in two-symbol grammar forms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

Colorings and interpretations: a connection between graphs and grammar forms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

1980

MSW Spaces

[BibT_eX]

[DOI]

Inf. Control., September, 1980

Pure Grammars

[BibT_eX]

[DOI]

Inf. Control., January, 1980

Synchronized E0L Forms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Context-Free Grammar Forms with Strict Interpretations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

Test Sets and Checking Words for Homomorphism Equivalence.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

On Generators and Generative Capacity of EOL Forms.

[BibT_eX]

[DOI]

Acta Informatica, 1980

Grammatical Families.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

Context-Dependent L Forms

[BibT_eX]

[DOI]

Inf. Control., July, 1979

On Non Context-Free Grammar Forms.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1979

Pure interpretations for EOL forms.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1979

Power from Power Series.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978

Uniform Interpretations of L Forms

[BibT_eX]

[DOI]

Inf. Control., February, 1978

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

On Good E0L Forms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

ETOL Forms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1978

On the Decidability of Homomorphism Equivalence for Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1978

Relative Goodness for EOL Forms.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1978

Equality sets for homomorphisms of free monoids.

[BibT_eX]

[DOI]

Acta Cybern., 1978

Formale Sprachen.

[BibT_eX]

Springer, ISBN: 978-3-540-09030-4, 1978

Automata-Theoretic Aspects of Formal Power Series.

[BibT_eX]

[DOI]

Matti Soittola

Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4612-6264-0, 1978

1977

Bibliography of L Systems.

[BibT_eX]

[DOI]

Martti Penttonen

Theor. Comput. Sci., 1977

On the Form Equivalence of L-Forms.

[BibT_eX]

[DOI]

Thomas Ottmann

Theor. Comput. Sci., 1977

New squeezing mechanisms for L systems.

[BibT_eX]

[DOI]

Inf. Sci., 1977

EOL Forms.

[BibT_eX]

[DOI]

Acta Informatica, 1977

1976

Context-Free Grammars with Graph-Controlled Tables.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

Undecidable Problems Concerning Growth in Informationless Lindenmayer Systems.

[BibT_eX]