Henning Bordihn

ORCID

Publication Activity (10 Years)

Years Active: 1992-2022
Publications (10 Years): 18

Top Venues

J. Autom. Lang. Comb.

Acta Informatica

Int. J. Found. Comput. Sci.

Nat. Comput.

Technische Hochschule Magdeburg, Germany (PHD)

Education History

Technische Hochschule Magdeburg, Germany

PHD

Publications

Henning Bordihn, Helmut Jürgensen
Multi-Wave Soliton Automata. J. Autom. Lang. Comb. 27 (1-3) (2022)
Henning Bordihn, György Vaszil
Reversible parallel communicating finite automata systems. Acta Informatica 58 (4) (2021)
Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun
Hairpin completions and reductions: semilinearity properties. Nat. Comput. 20 (2) (2021)
Henning Bordihn, Markus Holzer
On the number of active states in finite automata. Acta Informatica 58 (4) (2021)
Henning Bordihn, Victor Mitrana
On the degrees of non-regularity and non-context-freeness. J. Comput. Syst. Sci. 108 (2020)
Henning Bordihn, György Vaszil
Deterministic Lindenmayer Systems with Dynamic Control of Parallelism. Int. J. Found. Comput. Sci. 31 (1) (2020)
Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun
Further Properties of Self-assembly by Hairpin Formation. UCNC (2019)
Henning Bordihn, Victor Mitrana, Maria C. Negru, Andrei Paun, Mihaela Paun
Small networks of polarized splicing processors are universal. Nat. Comput. 17 (4) (2018)
Henning Bordihn, Benedek Nagy, György Vaszil
Preface: Non-classical models of automata and applications VIII. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Suna Bensch, Henning Bordihn
Information, Codes, and Languages - Preface. J. Autom. Lang. Comb. 23 (1-3) (2018)
Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun
Networks of Polarized Splicing Processors. TPNC (2017)
Henning Bordihn, Markus Holzer
On the Number of Active States in Deterministic and Nondeterministic Finite Automata. CIAA (2017)
Henning Bordihn
Active symbols in grammars with valuations. Theor. Comput. Sci. 682 (2017)
Henning Bordihn, Paolo Bottoni, Anna Labella, Victor Mitrana
Networks of picture processors as problem solvers. Soft Comput. 21 (19) (2017)
Henning Bordihn, György Vaszil
On Lindenmayer Systems with Dynamic Control of Parallelism. J. Autom. Lang. Comb. 21 (1-2) (2016)
Henning Bordihn, Martin Kutrib, Andreas Malcher
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. Int. J. Found. Comput. Sci. 26 (8) (2015)
Pedro Pablo Alarcón, Fernando Arroyo, Henning Bordihn, Victor Mitrana, Mike Müller
Ambiguity of the Multiple Interpretations on Regular Languages. Fundam. Informaticae 138 (1-2) (2015)
Henning Bordihn, Anna-Lena Lamprecht, Tiziana Margaria
Foundations of Semantics and Model Checking in a Software Engineering Course. FMSEE&T@FM (2015)
Henning Bordihn, Florin Manea, Victor Mitrana, Daniel-Claudian Voinescu
Two Variants of Synchronized Shuffle on Backbones. Discrete Mathematics and Computer Science (2014)
Henning Bordihn, Paolo Bottoni, Anna Labella, Victor Mitrana
Solving 2D-Pattern Matching with Networks of Picture Processors. TPNC (2014)
Henning Bordihn, Helmut Jürgensen, Heiko Ritter
Soliton Automata with Multiple Waves. Computing with New Resources (2014)
Henning Bordihn, Martin Kutrib, Matthias Wendlandt
Nonterminal Controlled String Assembling Systems. J. Autom. Lang. Comb. 19 (1-4) (2014)
Henning Bordihn, Martin Kutrib, Andreas Malcher
Measuring Communication in Parallel Communicating Finite Automata. AFL (2014)
Henning Bordihn, Martin Kutrib, Andreas Malcher
On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 23 (3) (2012)
Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe
Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial. J. Autom. Lang. Comb. 16 (2-4) (2011)
Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto
Preface. Fundam. Informaticae 112 (2-3) (2011)
Henning Bordihn, Markus Holzer, Martin Kutrib
Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209 (3) (2011)
Henning Bordihn, Markus Holzer, Martin Kutrib
Hairpin Finite Automata. J. Autom. Lang. Comb. 16 (2-4) (2011)
Henning Bordihn, Martin Kutrib, Andreas Malcher
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 22 (7) (2011)
Henning Bordihn, Martin Kutrib, Andreas Malcher
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory (2010)
Henning Bordihn, Jürgen Dassow, Markus Holzer
Extending regular expressions with homomorphic replacement. RAIRO Theor. Informatics Appl. 44 (2) (2010)
Henning Bordihn, Bettina Sunckel
Descriptional Complexity of Restricted CD Grammar Systems. J. Autom. Lang. Comb. 14 (1) (2009)
Henning Bordihn, Markus Holzer, Martin Kutrib
Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410 (35) (2009)
Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib
On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207 (11) (2009)
Henning Bordihn, Markus Holzer, Martin Kutrib
Undecidability of Operation Problems for T0L Languages and Subclasses. LATA (2009)
Henning Bordihn, Markus Holzer
A note on cooperating distributed grammar systems working in combined modes. Inf. Process. Lett. 108 (1) (2008)
Henning Bordihn, Martin Kutrib, Andreas Malcher
On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory (2008)
Henning Bordihn, Markus Holzer, Martin Kutrib
State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS (2008)
Henning Bordihn, Markus Holzer
Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. LATA (2008)
Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib
Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA (2008)
Henning Bordihn, Bernd Reichel, Ralf Stiebe, Bianca Truthe
Preface: Aspects in Language and Automata Theory Special Issue Dedicated to JÜrgen Dassow. Int. J. Found. Comput. Sci. 18 (6) (2007)
Suna Bensch, Henning Bordihn
Active Symbols in Pure Systems. Fundam. Informaticae 76 (3) (2007)
Henning Bordihn, György Vaszil
On leftmost derivations in CD grammar systems. LATA (2007)
Henning Bordihn, Henning Fernau
The Degree of Parallelism. J. Autom. Lang. Comb. 12 (1-2) (2007)
Henning Bordihn, Markus Holzer
Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. Fundam. Informaticae 76 (3) (2007)
Henning Bordihn, Bettina Sunckel
On Active Symbols in CD Grammar Systems. J. Autom. Lang. Comb. 12 (1-2) (2007)
Henning Bordihn, György Vaszil
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. FCT (2007)
Henning Bordihn, Markus Holzer, Martin Kutrib
Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18 (4) (2007)
Henning Bordihn, Markus Holzer, Martin Kutrib
Hairpin Finite Automata. Developments in Language Theory (2007)
Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide
Iterated sequential transducers as language generating devices. Theor. Comput. Sci. 369 (1-3) (2006)
Henning Bordihn, Markus Holzer, Martin Kutrib
Hybrid Extended Finite Automata. CIAA (2006)
Henning Bordihn, Markus Holzer
Programmed grammars and their relation to the LBA problem. Acta Informatica 43 (4) (2006)
Henning Bordihn, Bettina Sunckel
On active symbols in CD grammar systems. DCFS (2005)
Henning Bordihn, Markus Holzer, Martin Kutrib
Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16 (3) (2005)
Henning Bordihn, Henning Fernau
The degree of parallelism. DCFS (2005)
Henning Bordihn, Markus Holzer, Martin Kutrib
Revolving-Input Finite Automata. Developments in Language Theory (2005)
Henning Bordihn
On the number of components in cooperating distributed grammar systems. Theor. Comput. Sci. 330 (2) (2005)
Henning Bordihn, Markus Holzer, Martin Kutrib
Economy of Description for Basic Constructions on Rational Transductions. J. Autom. Lang. Comb. 9 (2/3) (2004)
Henning Bordihn
Context-freeness of the power of context-free languages is undecidable. Theor. Comput. Sci. 314 (3) (2004)
Henning Bordihn, Markus Holzer, Martin Kutrib
Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. Developments in Language Theory (2004)
Henning Bordihn, Markus Holzer, Martin Kutrib
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA (2004)
Henning Bordihn, Helmut Jürgensen
Pushdown Information. DCFS (2004)
Suna Aydin, Henning Bordihn
Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity. Fundam. Informaticae 55 (3-4) (2003)
Henning Bordihn, Henning Fernau, Markus Holzer
On Iterated Sequential Transducers. Grammars and Automata for String Processing (2003)
Henning Bordihn
On the Number of Components in Cooperating Distributed Grammar Systems. DCFS (2003)
Henning Bordihn, Markus Holzer
On the Computational Complexity of Synchronized Context-Free Languages. J. Univers. Comput. Sci. 8 (2) (2002)
Henning Bordihn, Bernd Reichel
On Descriptions of Context-Free Languages by CD Grammar Systems. J. Autom. Lang. Comb. 7 (4) (2002)
Henning Bordihn, Markus Holzer, Martin Kutrib
Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS (2002)
Henning Bordihn, Markus Holzer
On the Number of Active Symbols in L and CD Grammar Systems. J. Autom. Lang. Comb. 6 (4) (2001)
Henning Bordihn, Bernd Reichel
On Descriptions of Context-Free Languages by CD Grammar Systems. DCFS (2001)
Henning Bordihn, Jürgen Dassow, György Vaszil
Parallel Communicating Grammar Systems As Language Analyzers. Grammars 3 (1) (2000)
Henning Bordihn, Markus Holzer
Grammar Systems with Negated Conditions in their Cooperation Protocols J. Univers. Comput. Sci. 6 (12) (2000)
Henning Bordihn, Erzsébet Csuhaj-Varjú, Jürgen Dassow
CD Grammar Systems Versus L Systems. Grammatical Models of Multi-Agent Systems (1999)
Henning Bordihn, Henning Fernau, Markus Holzer
On Accepting Pure Lindenmayer Systems. Fundam. Informaticae 38 (4) (1999)
Henning Bordihn, Jürgen Dassow, György Vaszil
Grammar Systems as Language Analyzers and Recursively Enumerable Languages. FCT (1999)
Henning Bordihn, Markus Holzer
Cooperating distributed grammar systems with non-terminating components. Developments in Language Theory (1999)
Henning Bordihn, Markus Holzer
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. Inf. Process. Lett. 69 (2) (1999)
Henning Bordihn
A Grammatical Approach to the LBA Problem. New Trends in Formal Languages (1997)
Henning Fernau, Markus Holzer, Henning Bordihn
Accepting Multi-Agent Systems. Comput. Artif. Intell. 15 (2-3) (1996)
Henning Bordihn, Erzsébet Csuhaj-Varjú
On Competence and Completeness in CD Grammar Systems. Acta Cybern. 12 (4) (1996)
Henning Bordihn, Henning Fernau
Accepting Grammars and Systems via Context Condition Grammars. J. Autom. Lang. Comb. 1 (2) (1996)
Henning Bordihn, Henning Fernau
Accepting Grammars and Systems: An Overview. Developments in Language Theory (1995)
Henning Fernau, Henning Bordihn
Remarks on accepting parallel systems. Int. J. Comput. Math. 56 (1-2) (1995)
Henning Bordihn, Jürgen Dassow
A Note on the Degree of Nondeterminism. Developments in Language Theory (1993)
Henning Bordihn
Pure Languages and the Degree of Nondeterminism. J. Inf. Process. Cybern. 28 (5) (1992)

Henning Bordihn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Henning Bordihn