The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Henning Bordihn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Henning Bordihn
    A Grammatical Approach to the LBA Problem. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:1-9 [Conf]
  2. Henning Bordihn, Henning Fernau, Markus Holzer
    On Iterated Sequential Transducers. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:121-130 [Conf]
  3. Henning Bordihn, Jürgen Dassow
    A Note on the Degree of Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:70-80 [Conf]
  4. Henning Bordihn, Henning Fernau
    Accepting Grammars and Systems: An Overview. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:199-208 [Conf]
  5. Henning Bordihn, Markus Holzer
    Cooperating distributed grammar systems with non-terminating components. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:305-315 [Conf]
  6. Henning Bordihn, Markus Holzer, Martin Kutrib
    Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:102-113 [Conf]
  7. Henning Bordihn, Markus Holzer, Martin Kutrib
    Revolving-Input Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:168-179 [Conf]
  8. Henning Bordihn, Jürgen Dassow, György Vaszil
    Grammar Systems as Language Analyzers and Recursively Enumerable Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:136-147 [Conf]
  9. Henning Bordihn, Erzsébet Csuhaj-Varjú, Jürgen Dassow
    CD Grammar Systems Versus L Systems. [Citation Graph (0, 0)][DBLP]
    Grammatical Models of Multi-Agent Systems, 1999, pp:18-32 [Conf]
  10. Henning Bordihn, Markus Holzer, Martin Kutrib
    Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:68-79 [Conf]
  11. Henning Bordihn, Markus Holzer, Martin Kutrib
    Hybrid Extended Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:34-45 [Conf]
  12. Henning Bordihn, Markus Holzer
    Programmed grammars and their relation to the LBA problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2006, v:43, n:4, pp:223-242 [Journal]
  13. Henning Bordihn, Erzsébet Csuhaj-Varjú
    On Competence and Completeness in CD Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1996, v:12, n:4, pp:347-360 [Journal]
  14. Henning Fernau, Markus Holzer, Henning Bordihn
    Accepting Multi-Agent Systems. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1996, v:15, n:2-3, pp:- [Journal]
  15. Henning Bordihn
    Pure Languages and the Degree of Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1992, v:28, n:5, pp:231-240 [Journal]
  16. Suna Aydin, Henning Bordihn
    Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:55, n:3-4, pp:243-254 [Journal]
  17. Henning Bordihn, Henning Fernau, Markus Holzer
    On Accepting Pure Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:4, pp:365-375 [Journal]
  18. Suna Bensch, Henning Bordihn
    Active Symbols in Pure Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:76, n:3, pp:239-254 [Journal]
  19. Henning Bordihn, Markus Holzer
    Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:76, n:3, pp:255-270 [Journal]
  20. Henning Bordihn, Jürgen Dassow, György Vaszil
    Parallel Communicating Grammar Systems As Language Analyzers. [Citation Graph (0, 0)][DBLP]
    Grammars, 2000, v:3, n:1, pp:1-20 [Journal]
  21. Henning Bordihn, Markus Holzer, Martin Kutrib
    Unsolvability levels of operation problems for subclasses of context-free languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:423-440 [Journal]
  22. Henning Bordihn, Markus Holzer
    On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:2, pp:59-62 [Journal]
  23. Henning Bordihn, Henning Fernau
    Accepting Grammars and Systems via Context Condition Grammars. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1996, v:1, n:2, pp:97-112 [Journal]
  24. Henning Bordihn, Markus Holzer
    On the Number of Active Symbols in L and CD Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:411-426 [Journal]
  25. Henning Bordihn, Bernd Reichel
    On Descriptions of Context-Free Languages by CD Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:447-454 [Journal]
  26. Henning Bordihn, Markus Holzer
    Grammar Systems with Negated Conditions in their Cooperation Protocols [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:12, pp:1165-1184 [Journal]
  27. Henning Bordihn, Markus Holzer
    On the Computational Complexity of Synchronized Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:119-140 [Journal]
  28. Henning Bordihn
    Context-freeness of the power of context-free languages is undecidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:314, n:3, pp:445-449 [Journal]
  29. Henning Bordihn
    On the number of components in cooperating distributed grammar systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:195-204 [Journal]
  30. Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide
    Iterated sequential transducers as language generating devices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:67-81 [Journal]
  31. Henning Bordihn, Markus Holzer, Martin Kutrib
    Hairpin Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:108-119 [Conf]
  32. Henning Bordihn, György Vaszil
    Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:113-124 [Conf]

  33. On the Computational Capacity of Parallel Communicating Finite Automata. [Citation Graph (, )][DBLP]


  34. Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. [Citation Graph (, )][DBLP]


  35. Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. [Citation Graph (, )][DBLP]


  36. Deterministic Input-Reversal and Input-Revolving Finite Automata. [Citation Graph (, )][DBLP]


  37. Undecidability of Operation Problems for T0L Languages and Subclasses. [Citation Graph (, )][DBLP]


Search in 0.073secs, Finished in 0.074secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002