Pure Languages and the Degree of Nondeterminism. - Henning Bordihn (J. Inf. Process. Cybern., 1992)

Über den Determiniertheitsgrad reiner Versionen formaler Sprachen. - Henning Bordihn (1992)

A Note on the Degree of Nondeterminism. - Henning Bordihn; Jürgen Dassow (Developments in Language Theory, 1993)

Accepting Grammars and Systems: An Overview. - Henning Bordihn; Henning Fernau (Developments in Language Theory, 1995)

Remarks on accepting parallel systems. - Henning Fernau; Henning Bordihn (Int. J. Comput. Math., 1995)

On Competence and Completeness in CD Grammar Systems. - Henning Bordihn; Erzsébet Csuhaj-Varjú (Acta Cybern., 1996)

Accepting Multi-Agent Systems. - Henning Fernau; Markus Holzer 001; Henning Bordihn (Comput. Artif. Intell., 1996)

Accepting Grammars and Systems via Context Condition Grammars. - Henning Bordihn; Henning Fernau (J. Autom. Lang. Comb., 1996)

A Grammatical Approach to the LBA Problem. - Henning Bordihn (New Trends in Formal Languages, 1997)

Cooperating distributed grammar systems with non-terminating components. - Henning Bordihn; Markus Holzer 001 (Developments in Language Theory, 1999)

Grammar Systems as Language Analyzers and Recursively Enumerable Languages. - Henning Bordihn; Jürgen Dassow; György Vaszil (FCT, 1999)

CD Grammar Systems Versus L Systems. - Henning Bordihn; Erzsébet Csuhaj-Varjú; Jürgen Dassow (Grammatical Models of Multi-Agent Systems, 1999)

On Accepting Pure Lindenmayer Systems. - Henning Bordihn; Henning Fernau; Markus Holzer 001 (Fundam. Informaticae, 1999)

On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. - Henning Bordihn; Markus Holzer 001 (Inf. Process. Lett., 1999)

Parallel Communicating Grammar Systems As Language Analyzers. - Henning Bordihn; Jürgen Dassow; György Vaszil (Grammars, 2000)

Grammar Systems with Negated Conditions in their Cooperation Protocols - Henning Bordihn; Markus Holzer 001 (J. Univers. Comput. Sci., 2000)

On the Number of Active Symbols in L and CD Grammar Systems. - Henning Bordihn; Markus Holzer 001 (J. Autom. Lang. Comb., 2001)

Economy of Descriptions for Basic Constructions on Rational Transductions. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (DCFS, 2002)

On Descriptions of Context-Free Languages by CD Grammar Systems. - Henning Bordihn; Bernd Reichel (J. Autom. Lang. Comb., 2002)

On the Computational Complexity of Synchronized Context-Free Languages. - Henning Bordihn; Markus Holzer 001 (J. Univers. Comput. Sci., 2002)

On Iterated Sequential Transducers. - Henning Bordihn; Henning Fernau; Markus Holzer 001 (Grammars and Automata for String Processing, 2003)

Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity. - Suna Aydin; Henning Bordihn (Fundam. Informaticae, 2003)

Pushdown Information. - Henning Bordihn; Helmut Jürgensen (DCFS, 2004)

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (Developments in Language Theory, 2004)

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (CIAA, 2004)

Economy of Description for Basic Constructions on Rational Transductions. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (J. Autom. Lang. Comb., 2004)

Context-freeness of the power of context-free languages is undecidable. - Henning Bordihn (Theor. Comput. Sci., 2004)

Revolving-Input Finite Automata. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (Developments in Language Theory, 2005)

Unsolvability levels of operation problems for subclasses of context-free languages. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (Int. J. Found. Comput. Sci., 2005)

On the number of components in cooperating distributed grammar systems. - Henning Bordihn (Theor. Comput. Sci., 2005)

Programmed grammars and their relation to the LBA problem. - Henning Bordihn; Markus Holzer 001 (Acta Informatica, 2006)

Iterated sequential transducers as language generating devices. - Henning Bordihn; Henning Fernau; Markus Holzer 001; Vincenzo Manca; Carlos Martín-Vide (Theor. Comput. Sci., 2006)

Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. - Henning Bordihn; György Vaszil (FCT, 2007)

Active Symbols in Pure Systems. - Suna Bensch; Henning Bordihn (Fundam. Informaticae, 2007)

Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. - Henning Bordihn; Markus Holzer 001 (Fundam. Informaticae, 2007)

Hybrid Extended Finite Automata. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (Int. J. Found. Comput. Sci., 2007)

Preface: Aspects in Language and Automata Theory Special Issue Dedicated to JÜrgen Dassow. - Henning Bordihn; Bernd Reichel; Ralf Stiebe; Bianca Truthe (Int. J. Found. Comput. Sci., 2007)

The Degree of Parallelism. - Henning Bordihn; Henning Fernau (J. Autom. Lang. Comb., 2007)

On Active Symbols in CD Grammar Systems. - Henning Bordihn; Bettina Sunckel (J. Autom. Lang. Comb., 2007)

State Complexity of NFA to DFA Conversion of Subregular Language Families. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (DCFS, 2008)

Deterministic Input-Reversal and Input-Revolving Finite Automata. - Suna Bensch; Henning Bordihn; Markus Holzer 001; Martin Kutrib (LATA, 2008)

Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. - Henning Bordihn; Markus Holzer 001 (LATA, 2008)

A note on cooperating distributed grammar systems working in combined modes. - Henning Bordihn; Markus Holzer 001 (Inf. Process. Lett., 2008)

Undecidability of Operation Problems for T0L Languages and Subclasses. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (LATA, 2009)

On input-revolving deterministic and nondeterministic finite automata. - Suna Bensch; Henning Bordihn; Markus Holzer 001; Martin Kutrib (Inf. Comput., 2009)

Descriptional Complexity of Restricted CD Grammar Systems. - Henning Bordihn; Bettina Sunckel (J. Autom. Lang. Comb., 2009)

Determination of finite automata accepting subregular languages. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (Theor. Comput. Sci., 2009)

Extending regular expressions with homomorphic replacement. - Henning Bordihn; Jürgen Dassow; Markus Holzer 001 (RAIRO Theor. Informatics Appl., 2010)

Preface. - Henning Bordihn; Rudolf Freund; Mika Hirvensalo; Markus Holzer 001; Martin Kutrib; Friedrich Otto (Fundam. Informaticae, 2011)

Decidability of operation problems for T0L languages and subclasses. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (Inf. Comput., 2011)

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. - Henning Bordihn; Martin Kutrib; Andreas Malcher (Int. J. Found. Comput. Sci., 2011)

Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial. - Henning Bordihn; Jürgen Dassow; Martin Kutrib; Bianca Truthe (J. Autom. Lang. Comb., 2011)

Hairpin Finite Automata. - Henning Bordihn; Markus Holzer 001; Martin Kutrib (J. Autom. Lang. Comb., 2011)

On the Computational Capacity of Parallel Communicating Finite Automata. - Henning Bordihn; Martin Kutrib; Andreas Malcher (Int. J. Found. Comput. Sci., 2012)

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

Soliton Automata with Multiple Waves. - Henning Bordihn; Helmut Jürgensen; Heiko Ritter (Computing with New Resources, 2014)

Two Variants of Synchronized Shuffle on Backbones. - Henning Bordihn; Florin Manea; Victor Mitrana; Daniel-Claudian Voinescu (Discrete Mathematics and Computer Science, 2014)

Solving 2D-Pattern Matching with Networks of Picture Processors. - Henning Bordihn; Paolo Bottoni; Anna Labella; Victor Mitrana (TPNC, 2014)

Measuring Communication in Parallel Communicating Finite Automata. - Henning Bordihn; Martin Kutrib; Andreas Malcher (AFL, 2014)

Nonterminal Controlled String Assembling Systems. - Henning Bordihn; Martin Kutrib; Matthias Wendlandt (J. Autom. Lang. Comb., 2014)

Foundations of Semantics and Model Checking in a Software Engineering Course. - Henning Bordihn; Anna-Lena Lamprecht; Tiziana Margaria (FMSEE&T@FM, 2015)

Ambiguity of the Multiple Interpretations on Regular Languages. - Pedro Pablo Alarcón; Fernando Arroyo; Henning Bordihn; Victor Mitrana; Mike Müller (Fundam. Informaticae, 2015)

Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. - Henning Bordihn; Martin Kutrib; Andreas Malcher (Int. J. Found. Comput. Sci., 2015)

On Lindenmayer Systems with Dynamic Control of Parallelism. - Henning Bordihn; György Vaszil (J. Autom. Lang. Comb., 2016)

Networks of Polarized Splicing Processors. - Henning Bordihn; Victor Mitrana; Andrei Paun; Mihaela Paun (TPNC, 2017)

On the Number of Active States in Deterministic and Nondeterministic Finite Automata. - Henning Bordihn; Markus Holzer 001 (CIAA, 2017)

Networks of picture processors as problem solvers. - Henning Bordihn; Paolo Bottoni; Anna Labella; Victor Mitrana (Soft Comput., 2017)

Active symbols in grammars with valuations. - Henning Bordihn (Theor. Comput. Sci., 2017)

Preface: Non-classical models of automata and applications VIII. - Henning Bordihn; Benedek Nagy; György Vaszil (RAIRO Theor. Informatics Appl., 2018)

Information, Codes, and Languages - Preface. - Suna Bensch; Henning Bordihn (J. Autom. Lang. Comb., 2018)

Small networks of polarized splicing processors are universal. - Henning Bordihn; Victor Mitrana; Maria C. Negru; Andrei Paun; Mihaela Paun (Nat. Comput., 2018)

Further Properties of Self-assembly by Hairpin Formation. - Henning Bordihn; Victor Mitrana; Andrei Paun; Mihaela Paun (UCNC, 2019)

Deterministic Lindenmayer Systems with Dynamic Control of Parallelism. - Henning Bordihn; György Vaszil (Int. J. Found. Comput. Sci., 2020)

On the degrees of non-regularity and non-context-freeness. - Henning Bordihn; Victor Mitrana (J. Comput. Syst. Sci., 2020)

On the number of active states in finite automata. - Henning Bordihn; Markus Holzer 001 (Acta Informatica, 2021)

Reversible parallel communicating finite automata systems. - Henning Bordihn; György Vaszil (Acta Informatica, 2021)

Hairpin completions and reductions: semilinearity properties. - Henning Bordihn; Victor Mitrana; Andrei Paun; Mihaela Paun (Nat. Comput., 2021)

Multi-Wave Soliton Automata. - Henning Bordihn; Helmut Jürgensen (J. Autom. Lang. Comb., 2022)

Determinism in Multi-Soliton Automata. - Henning Bordihn; Helena Schulz (NCMA, 2024)

Leftmost Derivations in CD Grammar Systems. - Henning Bordihn; György Vaszil (Int. J. Found. Comput. Sci., 2025)