Henning Bordihn

From MaRDI portal
Person:553299

Available identifiers

zbMath Open bordihn.henningMaRDI QIDQ553299

List of research outcomes





PublicationDate of PublicationType
Small networks of polarized splicing processors are universal2023-11-30Paper
Hairpin completions and reductions: semilinearity properties2023-09-08Paper
Networks of Polarized Splicing Processors2022-12-09Paper
https://portal.mardi4nfdi.de/entity/Q58675182022-09-14Paper
Reversible parallel communicating finite automata systems2021-07-23Paper
On the number of active states in finite automata2021-07-23Paper
https://portal.mardi4nfdi.de/entity/Q49949392021-06-22Paper
Deterministic Lindenmayer Systems with Dynamic Control of Parallelism2020-02-21Paper
On the degrees of non-regularity and non-context-freeness2019-11-29Paper
Further properties of self-assembly by hairpin formation2019-10-10Paper
Networks of picture processors as problem solvers2018-04-26Paper
On the number of active states in deterministic and nondeterministic finite automata2017-08-22Paper
Active symbols in grammars with valuations2017-06-15Paper
https://portal.mardi4nfdi.de/entity/Q31788702016-12-20Paper
https://portal.mardi4nfdi.de/entity/Q55070562016-12-16Paper
Hairpin finite automata2016-09-29Paper
On a hierarchy of languages generated by cooperating distributed grammar systems2016-06-16Paper
Ambiguity of the multiple interpretations on regular languages2016-05-11Paper
Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities2016-04-15Paper
Soliton Automata with Multiple Waves2015-09-08Paper
On the computational capacity of parallel communicating finite automata2012-08-30Paper
Undecidability and hierarchy results for parallel communicating finite automata2012-08-29Paper
Decidability of operation problems for T0L languages and subclasses2011-07-27Paper
Undecidability and hierarchy results for parallel communicating finite automata2010-08-31Paper
Extending regular expressions with homomorphic replacement2010-06-07Paper
A note on cooperating distributed grammar systems working in combined modes2010-04-19Paper
On input-revolving deterministic and nondeterministic finite automata2009-11-27Paper
https://portal.mardi4nfdi.de/entity/Q51929872009-08-10Paper
Determination of finite automata accepting subregular languages2009-08-07Paper
Undecidability of Operation Problems for T0L Languages and Subclasses2009-04-02Paper
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems2008-11-20Paper
Deterministic Input-Reversal and Input-Revolving Finite Automata2008-11-20Paper
On the Computational Capacity of Parallel Communicating Finite Automata2008-10-30Paper
The degree of parallelism2008-08-12Paper
On active symbols in CD grammar systems2008-08-12Paper
HYBRID EXTENDED FINITE AUTOMATA2008-05-20Paper
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems2008-02-26Paper
Hairpin Finite Automata2007-11-28Paper
https://portal.mardi4nfdi.de/entity/Q54222292007-10-17Paper
Hybrid Extended Finite Automata2007-09-06Paper
https://portal.mardi4nfdi.de/entity/Q34312342007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q34312332007-04-10Paper
Iterated sequential transducers as language generating devices2007-01-09Paper
Programmed grammars and their relation to the LBA problem2006-11-27Paper
https://portal.mardi4nfdi.de/entity/Q54859902006-09-06Paper
Developments in Language Theory2006-06-23Paper
Developments in Language Theory2005-12-22Paper
https://portal.mardi4nfdi.de/entity/Q53137832005-09-01Paper
Implementation and Application of Automata2005-08-17Paper
UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q46628282005-03-30Paper
On the number of components in cooperating distributed grammar systems2005-02-22Paper
Context-freeness of the power of context-free languages is undecidable2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44653302004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44584892004-03-18Paper
https://portal.mardi4nfdi.de/entity/Q44532012004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44329692003-10-29Paper
https://portal.mardi4nfdi.de/entity/Q47931272003-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45313702002-05-29Paper
Cooperating distributed grammar systems with non-terminating components2001-11-07Paper
Parallel communicating grammar systems as language analyzers2001-06-21Paper
Grammar systems with negated conditions in their cooperation protocols2001-05-10Paper
https://portal.mardi4nfdi.de/entity/Q49343242000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q49391862000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q43712481998-01-11Paper
https://portal.mardi4nfdi.de/entity/Q31251811997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q48867951996-10-15Paper
Remarks on accepting parallel systems1996-06-23Paper
Accepting grammars with regulation1995-10-10Paper
https://portal.mardi4nfdi.de/entity/Q40334971993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q37804611987-01-01Paper

Research outcomes over time

This page was built for person: Henning Bordihn