Henning Bordihn

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

Henning Bordihn, Martin Kutrib, Bianca Truthe (Eds.): Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 7300, Springer 2012, isbn 978-3-642-31643-2

Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto: Preface. Fundam. Inform. 112(2-3) (2011)

Henning Bordihn, Markus Holzer, Martin Kutrib: Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011)

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

Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe: Editorial. Journal of Automata, Languages and Combinatorics 16(2-4): 71-74 (2011)

Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Journal of Automata, Languages and Combinatorics 16(2-4): 91-107 (2011)

Henning Bordihn, Jürgen Dassow, Markus Holzer: Extending regular expressions with homomorphic replacement. RAIRO - Theor. Inf. and Applic. 44(2): 229-255 (2010)

Henning Bordihn, Martin Kutrib, Andreas Malcher: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99

Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto (Eds.): Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings. books@ocg.at 263, Austrian Computer Society 2010, isbn 978-3-85403-263-2

Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009)

Henning Bordihn, Bettina Sunckel: Descriptional Complexity of Restricted CD Grammar Systems. Journal of Automata, Languages and Combinatorics 14(1): 7-22 (2009)

Henning Bordihn, Markus Holzer, Martin Kutrib: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009)

Henning Bordihn, Markus Holzer, Martin Kutrib: Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246

Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto (Eds.): Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings. books@ocg.at 256, Austrian Computer Society 2009, isbn 978-3-85403-256-4

Henning Bordihn, Markus Holzer: A note on cooperating distributed grammar systems working in combined modes. Inf. Process. Lett. 108(1): 10-14 (2008)

Henning Bordihn, Markus Holzer, Martin Kutrib: State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96

Henning Bordihn, Martin Kutrib, Andreas Malcher: On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory 2008: 146-157

Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124

Henning Bordihn, Markus Holzer: Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. LATA 2008: 125-136

Suna Bensch, Henning Bordihn: Active Symbols in Pure Systems. Fundam. Inform. 76(3): 239-254 (2007)

Henning Bordihn, Markus Holzer: Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. Fundam. Inform. 76(3): 255-270 (2007)

Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007)

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): 1137-1138 (2007)

Henning Bordihn, Henning Fernau: The Degree of Parallelism. Journal of Automata, Languages and Combinatorics 12(1-2): 25-47 (2007)

Henning Bordihn, Bettina Sunckel: On Active Symbols in CD Grammar Systems. Journal of Automata, Languages and Combinatorics 12(1-2): 49-67 (2007)

Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Developments in Language Theory 2007: 108-119

Henning Bordihn, György Vaszil: Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. FCT 2007: 113-124

Henning Bordihn, György Vaszil: On leftmost derivations in CD grammar systems. LATA 2007: 187-198

Henning Bordihn, Markus Holzer: Programmed grammars and their relation to the LBA problem. Acta Inf. 43(4): 223-242 (2006)

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): 67-81 (2006)

Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. CIAA 2006: 34-45

Henning Bordihn, Markus Holzer, Martin Kutrib: Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16(3): 423-440 (2005)

Henning Bordihn: On the number of components in cooperating distributed grammar systems. Theor. Comput. Sci. 330(2): 195-204 (2005)

Henning Bordihn, Henning Fernau: The degree of parallelism. DCFS 2005: 51-62

Henning Bordihn, Bettina Sunckel: On active symbols in CD grammar systems. DCFS 2005: 63-74

Henning Bordihn, Markus Holzer, Martin Kutrib: Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179

Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Description for Basic Constructions on Rational Transductions. Journal of Automata, Languages and Combinatorics 9(2/3): 175-188 (2004)

Henning Bordihn: Context-freeness of the power of context-free languages is undecidable. Theor. Comput. Sci. 314(3): 445-449 (2004)

Henning Bordihn, Helmut Jürgensen: Pushdown Information. DCFS 2004: 111-120

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: 102-113

Henning Bordihn, Markus Holzer, Martin Kutrib: Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79

Suna Aydin, Henning Bordihn: Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity. Fundam. Inform. 55(3-4): 243-254 (2003)

Henning Bordihn, Henning Fernau, Markus Holzer: On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130

Henning Bordihn: On the Number of Components in Cooperating Distributed Grammar Systems. DCFS 2003: 81-89

Henning Bordihn, Bernd Reichel: On Descriptions of Context-Free Languages by CD Grammar Systems. Journal of Automata, Languages and Combinatorics 7(4): 447-454 (2002)

Henning Bordihn, Markus Holzer: On the Computational Complexity of Synchronized Context-Free Languages. J. UCS 8(2): 119-140 (2002)

Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69

Henning Bordihn, Markus Holzer: On the Number of Active Symbols in L and CD Grammar Systems. Journal of Automata, Languages and Combinatorics 6(4): 411-426 (2001)

Henning Bordihn, Bernd Reichel: On Descriptions of Context-Free Languages by CD Grammar Systems. DCFS 2001: 47-53

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

Henning Bordihn, Markus Holzer: Grammar Systems with Negated Conditions in their Cooperation Protocols. J. UCS 6(12): 1165-1184 (2000)

Henning Bordihn, Henning Fernau, Markus Holzer: On Accepting Pure Lindenmayer Systems. Fundam. Inform. 38(4): 365-375 (1999)

Henning Bordihn, Markus Holzer: On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. Inf. Process. Lett. 69(2): 59-62 (1999)

Henning Bordihn, Markus Holzer: Cooperating distributed grammar systems with non-terminating components. Developments in Language Theory 1999: 305-315

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

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

Henning Bordihn: A Grammatical Approach to the LBA Problem. New Trends in Formal Languages 1997: 1-9

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

Henning Fernau, Markus Holzer, Henning Bordihn: Accepting Multi-Agent Systems. Computers and Artificial Intelligence 15(2-3) (1996)

Henning Bordihn, Henning Fernau: Accepting Grammars and Systems via Context Condition Grammars. Journal of Automata, Languages and Combinatorics 1(2): 97-112 (1996)

Henning Bordihn, Henning Fernau: Accepting Grammars and Systems: An Overview. Developments in Language Theory 1995: 199-208

Henning Bordihn, Jürgen Dassow: A Note on the Degree of Nondeterminism. Developments in Language Theory 1993: 70-80

Henning Bordihn: Pure Languages and the Degree of Nondeterminism. Elektronische Informationsverarbeitung und Kybernetik 28(5): 231-240 (1992)