Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Henning Bordihn
2010 – today
- 2012
[j35]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)- [e3]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
- 2011
- [j34]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto: Preface. Fundam. Inform. 112(2-3) (2011)
- [j33]Henning Bordihn, Markus Holzer, Martin Kutrib: Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011)
- [j32]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)
- [j31]Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe: Editorial. Journal of Automata, Languages and Combinatorics 16(2-4): 71-74 (2011)
- [j30]Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Journal of Automata, Languages and Combinatorics 16(2-4): 91-107 (2011)
- 2010
- [j29]Henning Bordihn, Jürgen Dassow, Markus Holzer: Extending regular expressions with homomorphic replacement. RAIRO - Theor. Inf. and Applic. 44(2): 229-255 (2010)
- [c26]Henning Bordihn, Martin Kutrib, Andreas Malcher: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99
- [e2]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
2000 – 2009
- 2009
- [j28]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009)
- [j27]Henning Bordihn, Bettina Sunckel: Descriptional Complexity of Restricted CD Grammar Systems. Journal of Automata, Languages and Combinatorics 14(1): 7-22 (2009)
- [j26]Henning Bordihn, Markus Holzer, Martin Kutrib: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009)
- [c25]Henning Bordihn, Markus Holzer, Martin Kutrib: Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246
- [e1]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
- 2008
- [j25]Henning Bordihn, Markus Holzer: A note on cooperating distributed grammar systems working in combined modes. Inf. Process. Lett. 108(1): 10-14 (2008)
- [c24]Henning Bordihn, Markus Holzer, Martin Kutrib: State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96
- [c23]Henning Bordihn, Martin Kutrib, Andreas Malcher: On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory 2008: 146-157
- [c22]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124
- [c21]Henning Bordihn, Markus Holzer: Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. LATA 2008: 125-136
- 2007
- [j24]
- [j23]Henning Bordihn, Markus Holzer: Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. Fundam. Inform. 76(3): 255-270 (2007)
- [j22]Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007)
- [j21]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)
- [j20]Henning Bordihn, Henning Fernau: The Degree of Parallelism. Journal of Automata, Languages and Combinatorics 12(1-2): 25-47 (2007)
- [j19]Henning Bordihn, Bettina Sunckel: On Active Symbols in CD Grammar Systems. Journal of Automata, Languages and Combinatorics 12(1-2): 49-67 (2007)
- [c20]Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Developments in Language Theory 2007: 108-119
- [c19]Henning Bordihn, György Vaszil: Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. FCT 2007: 113-124
- [c18]
- 2006
- [j18]Henning Bordihn, Markus Holzer: Programmed grammars and their relation to the LBA problem. Acta Inf. 43(4): 223-242 (2006)
- [j17]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)
- [c17]
- 2005
- [j16]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)
- [j15]Henning Bordihn: On the number of components in cooperating distributed grammar systems. Theor. Comput. Sci. 330(2): 195-204 (2005)
- [c16]
- [c15]
- [c14]Henning Bordihn, Markus Holzer, Martin Kutrib: Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179
- 2004
- [j14]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)
- [j13]Henning Bordihn: Context-freeness of the power of context-free languages is undecidable. Theor. Comput. Sci. 314(3): 445-449 (2004)
- [c13]
- [c12]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
- [c11]Henning Bordihn, Markus Holzer, Martin Kutrib: Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79
- 2003
- [j12]Suna Aydin, Henning Bordihn: Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity. Fundam. Inform. 55(3-4): 243-254 (2003)
- [c10]Henning Bordihn, Henning Fernau, Markus Holzer: On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130
- [c9]Henning Bordihn: On the Number of Components in Cooperating Distributed Grammar Systems. DCFS 2003: 81-89
- 2002
- [j11]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)
- [j10]Henning Bordihn, Markus Holzer: On the Computational Complexity of Synchronized Context-Free Languages. J. UCS 8(2): 119-140 (2002)
- [c8]Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69
- 2001
- [j9]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)
- [c7]Henning Bordihn, Bernd Reichel: On Descriptions of Context-Free Languages by CD Grammar Systems. DCFS 2001: 47-53
- 2000
- [j8]Henning Bordihn, Jürgen Dassow, György Vaszil: Parallel Communicating Grammar Systems As Language Analyzers. Grammars 3(1): 1-20 (2000)
- [j7]Henning Bordihn, Markus Holzer: Grammar Systems with Negated Conditions in their Cooperation Protocols. J. UCS 6(12): 1165-1184 (2000)
1990 – 1999
- 1999
- [j6]Henning Bordihn, Henning Fernau, Markus Holzer: On Accepting Pure Lindenmayer Systems. Fundam. Inform. 38(4): 365-375 (1999)
- [j5]Henning Bordihn, Markus Holzer: On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. Inf. Process. Lett. 69(2): 59-62 (1999)
- [c6]Henning Bordihn, Markus Holzer: Cooperating distributed grammar systems with non-terminating components. Developments in Language Theory 1999: 305-315
- [c5]Henning Bordihn, Jürgen Dassow, György Vaszil: Grammar Systems as Language Analyzers and Recursively Enumerable Languages. FCT 1999: 136-147
- [c4]Henning Bordihn, Erzsébet Csuhaj-Varjú, Jürgen Dassow: CD Grammar Systems Versus L Systems. Grammatical Models of Multi-Agent Systems 1999: 18-32
- 1997
- [c3]Henning Bordihn: A Grammatical Approach to the LBA Problem. New Trends in Formal Languages 1997: 1-9
- 1996
- [j4]Henning Bordihn, Erzsébet Csuhaj-Varjú: On Competence and Completeness in CD Grammar Systems. Acta Cybern. 12(4): 347-360 (1996)
- [j3]Henning Fernau, Markus Holzer, Henning Bordihn: Accepting Multi-Agent Systems. Computers and Artificial Intelligence 15(2-3) (1996)
- [j2]Henning Bordihn, Henning Fernau: Accepting Grammars and Systems via Context Condition Grammars. Journal of Automata, Languages and Combinatorics 1(2): 97-112 (1996)
- 1995
- [c2]Henning Bordihn, Henning Fernau: Accepting Grammars and Systems: An Overview. Developments in Language Theory 1995: 199-208
- 1993
- [c1]Henning Bordihn, Jürgen Dassow: A Note on the Degree of Nondeterminism. Developments in Language Theory 1993: 70-80
- 1992
- [j1]Henning Bordihn: Pure Languages and the Degree of Nondeterminism. Elektronische Informationsverarbeitung und Kybernetik 28(5): 231-240 (1992)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:04 CEST by the dblp team