Henning Bordihn

Helena Schulz

Proceedings of the Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), 2024

2022

Multi-Wave Soliton Automata.

[BibT_eX]

[DOI]

Helmut Jürgensen

J. Autom. Lang. Comb., 2022

2021

Hairpin completions and reductions: semilinearity properties.

[BibT_eX]

[DOI]

Nat. Comput., 2021

Reversible parallel communicating finite automata systems.

[BibT_eX]

[DOI]

Acta Informatica, 2021

On the number of active states in finite automata.

[BibT_eX]

[DOI]

Acta Informatica, 2021

2020

On the degrees of non-regularity and non-context-freeness.

[BibT_eX]

[DOI]

Victor Mitrana

J. Comput. Syst. Sci., 2020

Deterministic Lindenmayer Systems with Dynamic Control of Parallelism.

[BibT_eX]

[DOI]

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

2019

Further Properties of Self-assembly by Hairpin Formation.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2019

2018

Small networks of polarized splicing processors are universal.

[BibT_eX]

[DOI]

Nat. Comput., 2018

Information, Codes, and Languages - Preface.

[BibT_eX]

[DOI]

Suna Bensch

J. Autom. Lang. Comb., 2018

Preface: Non-classical models of automata and applications VIII.

[BibT_eX]

[DOI]

Benedek Nagy

RAIRO Theor. Informatics Appl., 2018

2017

Active symbols in grammars with valuations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Networks of picture processors as problem solvers.

[BibT_eX]

[DOI]

Soft Comput., 2017

On the Number of Active States in Deterministic and Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2017

Networks of Polarized Splicing Processors.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing - 6th International Conference, 2017

2016

On Lindenmayer Systems with Dynamic Control of Parallelism.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2016

2015

Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities.

[BibT_eX]

[DOI]

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

Ambiguity of the Multiple Interpretations on Regular Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Foundations of Semantics and Model Checking in a Software Engineering Course.

[BibT_eX]

[DOI]

Anna-Lena Lamprecht

Tiziana Margaria

Proceedings of the First Workshop on Formal Methods in Software Engineering Education and Training, 2015

2014

Nonterminal Controlled String Assembling Systems.

[BibT_eX]

[DOI]

Matthias Wendlandt

J. Autom. Lang. Comb., 2014

Measuring Communication in Parallel Communicating Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Solving 2D-Pattern Matching with Networks of Picture Processors.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing, 2014

Two Variants of Synchronized Shuffle on Backbones.

[BibT_eX]

Florin Manea

Victor Mitrana

Daniel-Claudian Voinescu

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

Soliton Automata with Multiple Waves.

[BibT_eX]

[DOI]

Helmut Jürgensen

Heiko Ritter

Proceedings of the Computing with New Resources, 2014

2012

Contributions to the syntactical analysis beyond context-freeness (Beiträge zur syntaktischen Analyse nicht-kontextfreier Sprachen)

[BibT_eX]

[DOI]

, 2012

On the Computational Capacity of Parallel Communicating Finite Automata.

[BibT_eX]

[DOI]

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

2011

Hairpin Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata.

[BibT_eX]

[DOI]

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

Decidability of operation problems for T0L languages and subclasses.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

2010

Extending regular expressions with homomorphic replacement.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

2009

Determination of finite automata accepting subregular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Descriptional Complexity of Restricted CD Grammar Systems.

[BibT_eX]

[DOI]

Bettina Sunckel

J. Autom. Lang. Comb., 2009

On input-revolving deterministic and nondeterministic finite automata.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Undecidability of Operation Problems for T0L Languages and Subclasses.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

2008

A note on cooperating distributed grammar systems working in combined modes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

Deterministic Input-Reversal and Input-Revolving Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

State Complexity of NFA to DFA Conversion of Subregular Language Families.

[BibT_eX]

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

2007

On Active Symbols in CD Grammar Systems.

[BibT_eX]

[DOI]

Bettina Sunckel

J. Autom. Lang. Comb., 2007

The Degree of Parallelism.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

Preface: Aspects in Language and Automata Theory Special Issue Dedicated to JÜrgen Dassow.

[BibT_eX]

[DOI]

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

Hybrid Extended Finite Automata.

[BibT_eX]

[DOI]

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

Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Active Symbols in Pure Systems.

[BibT_eX]

[DOI]

Suna Bensch

Fundam. Informaticae, 2007

On leftmost derivations in CD grammar systems.

[BibT_eX]

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

Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

Iterated sequential transducers as language generating devices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Programmed grammars and their relation to the LBA problem.

[BibT_eX]

[DOI]

Acta Informatica, 2006

2005

On the number of components in cooperating distributed grammar systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Unsolvability levels of operation problems for subclasses of context-free languages.

[BibT_eX]

[DOI]

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

Revolving-Input Finite Automata.

[BibT_eX]

[DOI]

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

2004

Context-freeness of the power of context-free languages is undecidable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Economy of Description for Basic Constructions on Rational Transductions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

Pushdown Information.

[BibT_eX]

Helmut Jürgensen

Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003

Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity.

[BibT_eX]

[DOI]

Suna Aydin

Fundam. Informaticae, 2003

On Iterated Sequential Transducers.

[BibT_eX]

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002

On the Computational Complexity of Synchronized Context-Free Languages.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

On Descriptions of Context-Free Languages by CD Grammar Systems.

[BibT_eX]

[DOI]

Bernd Reichel

J. Autom. Lang. Comb., 2002

Economy of Descriptions for Basic Constructions on Rational Transductions.

[BibT_eX]

Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001

On the Number of Active Symbols in L and CD Grammar Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

2000

Grammar Systems with Negated Conditions in their Cooperation Protocols

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2000

Parallel Communicating Grammar Systems As Language Analyzers.

[BibT_eX]

[DOI]

Grammars, 2000

1999

On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

On Accepting Pure Lindenmayer Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

CD Grammar Systems Versus L Systems.

[BibT_eX]

Erzsébet Csuhaj-Varjú

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

Grammar Systems as Language Analyzers and Recursively Enumerable Languages.

[BibT_eX]

[DOI]

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

Cooperating distributed grammar systems with non-terminating components.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

1997

A Grammatical Approach to the LBA Problem.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

1996

Accepting Grammars and Systems via Context Condition Grammars.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1996

Accepting Multi-Agent Systems.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1996

On Competence and Completeness in CD Grammar Systems.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

Acta Cybern., 1996

1995

Remarks on accepting parallel systems.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1995

Accepting Grammars and Systems: An Overview.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1993

A Note on the Degree of Nondeterminism.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1992

Über den Determiniertheitsgrad reiner Versionen formaler Sprachen.

[BibT_eX]

[DOI]

PhD thesis, 1992

Pure Languages and the Degree of Nondeterminism.

[BibT_eX]