Grammar systems with negated conditions in their cooperation protocols (2008)
Henning Bordihn, Markus Holzer
Abstract: The investigation on Boolean operations on the stop conditions of derivation modes for cooperating distributed grammar systems is continued by considering the logical negation of such...
On the Computational Complexity of Synchronized Context-Free Languages 1 (2008)
Henning Bordihn, Markus Holzer
Abstract: We introduce counter synchronized context-free grammars and investigate their generative power. It turns out that the family of counter synchronized context-free languages is a proper...
Martin Kutrib, Thomas Worsch (hrsg, Thomas Worsch, Henning Bordihn, Henning Fernau, Accepting Programmed
Dem n"achsten Theorietag in Cunnersdorf bei K"onigsstein in der S"achsischen Schweiz w"unschen wir viel Erfolg. Giessen, im Dezember 1995 Martin Kutrib
Economy of Description for Basic Constructions on Rational Transductions (2007)
Henning Bordihn, Henning Bordihn, Markus Holzer, Markus Holzer, Martin Kutrib, Martin Kutrib
Abstract. The state complexities of basic constructions on rational transductions are investigated. Given rational transductions, described by rational transducers, and an operation thereon we...
Henning Bordihn, J Urgen Dassow
Abstract. We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of the grammars works in a parallel and synchronized manner on...
Accepting grammars and systems. (2007)
Bordihn, Henning, Fernau, Henning
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly...
On Accepting Pure Lindenmayer Systems (1999)
Henning Bordihn, Henning Fernau, Markus Holzer
. We consider pure Lindenmayer systems, more precisely, 0L and T0L systems as language accepting devices and compare them to their generating counterparts. Accepting Lindenmayer systems can be seen...
Accepting Pure Grammars and Systems (1999)
Henning Bordihn, Henning Fernau, Markus Holzer
We consider several types of pure grammars and systems as language acceptors and compare them to their generating counterparts. In contrast with the case (considered in earlier papers of the authors)...
Cooperating/Distributed Grammar Systems { (1998)
Fakultat Informatik, Holger Petersen, Henning Bordihn, Erzsebet Csuhaj-varju, Volker Diekert, Henning Fernau, ...
This report contains abstracts of the lectures presented at the workshop \Formal Languages, Automata
Accepting Pure Grammars (1996)
Henning Bordihn, Henning Fernau, Markus Holzer
. We consider several types of pure grammars as language acceptors and compare them to their generating counterparts. The focus is on pure grammars with controlled derivations (regulated rewriting)....
Accepting Grammars and Systems: An Overview (1995)
Henning Bordihn, Henning Fernau
We investigate several kinds of regulated rewriting (matrix, ordered, programmed, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer...
Accepting Programmed Grammars without Nonterminals (1995)
Henning Bordihn, Fakultat Fur Informatik, Henning Fernau, Fur Informatik
this paper, we consider the pure versions of this grammar type where we give up the distinction between terminal and nonterminal symbols. Such pure grammars are of interest because of the following...
Accepting Grammars and Systems: An Overview (1995)
Henning Bordihn, Henning Fernau
: We investigate several kinds of regulated rewriting (matrix, ordered, programmed, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer...
Accepting Grammars and Systems (1995)
Henning Bordihn, Fakultat Fur Informatik, Henning Fernau, Lehrstuhl Informatik Fur
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly...
in Nebenl"aufigkeitsmonoiden 10 (1995)
September Martin Kutrib, Thomas Worsch (hrsg, Inhaltsverzeichnis Programm, Henning Bordihn, Henning Fernau, ...
Accepting Grammars and Systems (1994)
Henning Bordihn Fakultat, Henning Bordihn, Fakultat Fur Informatik, Henning Fernau, Lehrstuhl Informatik Fur
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly...
Über den Determiniertheitsgrad reiner Versionen formaler Sprachen. (1992)
Magdeburg, Techn. Univ., Diss., 1992.