| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 59 |       | Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto: Preface. Fundam. Inform. 112(2-3): (2011) |
| 58 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011) |
| 56 |  | Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto: Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings Austrian Computer Society 2010 |
| 54 | | Henning Bordihn, Jürgen Dassow, Markus Holzer: Extending regular expressions with homomorphic replacement. RAIRO - Theor. Inf. and Applic. 44(2): 229-255 (2010) |
| 53 | | Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto: Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings Austrian Computer Society 2009 |
| 52 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246 |
| 51 | | Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009) |
| 50 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009) |
| 49 | | Henning Bordihn, Markus Holzer, Martin Kutrib: State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96 |
| 47 | | Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124 |
| 46 | | Henning Bordihn, Markus Holzer: Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. LATA 2008: 125-136 |
| 45 | | Henning Bordihn, Markus Holzer: A note on cooperating distributed grammar systems working in combined modes. Inf. Process. Lett. 108(1): 10-14 (2008) |
| 44 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Developments in Language Theory 2007: 108-119 |
| 40 | | Henning Bordihn, Markus Holzer: Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. Fundam. Inform. 76(3): 255-270 (2007) |
| 39 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007) |
| 35 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. CIAA 2006: 34-45 |
| 34 | | Henning Bordihn, Markus Holzer: Programmed grammars and their relation to the LBA problem. Acta Inf. 43(4): 223-242 (2006) |
| 33 | | 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) |
| 30 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179 |
| 29 | | 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) |
| 27 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79 |
| 25 | | 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 |
| 24 | | 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) |
| 21 | | Henning Bordihn, Henning Fernau, Markus Holzer: On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130 |
| 19 | | Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69 |
| 18 | | Henning Bordihn, Markus Holzer: On the Computational Complexity of Synchronized Context-Free Languages. J. UCS 8(2): 119-140 (2002) |
| 15 | | 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) |
| 13 | | Henning Bordihn, Markus Holzer: Grammar Systems with Negated Conditions in their Cooperation Protocols J. UCS 6(12): 1165-1184 (2000) |
| 12 | | Henning Bordihn, Markus Holzer: Cooperating distributed grammar systems with non-terminating components. Developments in Language Theory 1999: 305-315 |
| 9 | | Henning Bordihn, Henning Fernau, Markus Holzer: On Accepting Pure Lindenmayer Systems. Fundam. Inform. 38(4): 365-375 (1999) |
| 8 | | Henning Bordihn, Markus Holzer: On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. Inf. Process. Lett. 69(2): 59-62 (1999) |
| 5 | | Henning Fernau, Markus Holzer, Henning Bordihn: Accepting Multi-Agent Systems. Computers and Artificial Intelligence 15(2-3): (1996) |
Selection of 32 from 60 records - Henning Bordihn has 19 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page