Henning Bordihn

According to our database1, Henning Bordihn
  • authored at least 74 papers between 1992 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Active symbols in grammars with valuations.
Theor. Comput. Sci., 2017

Networks of picture processors as problem solvers.
Soft Comput., 2017

On the Number of Active States in Deterministic and Nondeterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2017

2016
On Lindenmayer Systems with Dynamic Control of Parallelism.
Journal of Automata, Languages and Combinatorics, 2016

2015
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities.
Int. J. Found. Comput. Sci., 2015

Ambiguity of the Multiple Interpretations on Regular Languages.
Fundam. Inform., 2015

Foundations of Semantics and Model Checking in a Software Engineering Course.
Proceedings of the First Workshop on Formal Methods in Software Engineering Education and Training, 2015

2014
Nonterminal Controlled String Assembling Systems.
Journal of Automata, Languages and Combinatorics, 2014

Measuring Communication in Parallel Communicating Finite Automata.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Solving 2D-Pattern Matching with Networks of Picture Processors.
Proceedings of the Theory and Practice of Natural Computing, 2014

Two Variants of Synchronized Shuffle on Backbones.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

Soliton Automata with Multiple Waves.
Proceedings of the Computing with New Resources, 2014

2012
On the Computational Capacity of Parallel Communicating Finite Automata.
Int. J. Found. Comput. Sci., 2012

2011
Hairpin Finite Automata.
Journal of Automata, Languages and Combinatorics, 2011

Editorial.
Journal of Automata, Languages and Combinatorics, 2011

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata.
Int. J. Found. Comput. Sci., 2011

Decidability of operation problems for T0L languages and subclasses.
Inf. Comput., 2011

Preface.
Fundam. Inform., 2011

2010
Extending regular expressions with homomorphic replacement.
RAIRO - Theor. Inf. and Applic., 2010

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Determination of finite automata accepting subregular languages.
Theor. Comput. Sci., 2009

Descriptional Complexity of Restricted CD Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2009

On input-revolving deterministic and nondeterministic finite automata.
Inf. Comput., 2009

Undecidability of Operation Problems for T0L Languages and Subclasses.
Proceedings of the Language and Automata Theory and Applications, 2009

2008
A note on cooperating distributed grammar systems working in combined modes.
Inf. Process. Lett., 2008

Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems.
Proceedings of the Language and Automata Theory and Applications, 2008

Deterministic Input-Reversal and Input-Revolving Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

On the Computational Capacity of Parallel Communicating Finite Automata.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

State Complexity of NFA to DFA Conversion of Subregular Language Families.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
On Active Symbols in CD Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2007

The Degree of Parallelism.
Journal of Automata, Languages and Combinatorics, 2007

Preface: Aspects in Language and Automata Theory Special Issue Dedicated to JÜrgen Dassow.
Int. J. Found. Comput. Sci., 2007

Hybrid Extended Finite Automata.
Int. J. Found. Comput. Sci., 2007

Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited.
Fundam. Inform., 2007

Active Symbols in Pure Systems.
Fundam. Inform., 2007

On leftmost derivations in CD grammar systems.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Hairpin Finite Automata.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Iterated sequential transducers as language generating devices.
Theor. Comput. Sci., 2006

Programmed grammars and their relation to the LBA problem.
Acta Inf., 2006

Hybrid Extended Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006

2005
On the number of components in cooperating distributed grammar systems.
Theor. Comput. Sci., 2005

Unsolvability levels of operation problems for subclasses of context-free languages.
Int. J. Found. Comput. Sci., 2005

Revolving-Input Finite Automata.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

On active symbols in CD grammar systems.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

The degree of parallelism.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
Context-freeness of the power of context-free languages is undecidable.
Theor. Comput. Sci., 2004

Economy of Description for Basic Constructions on Rational Transductions.
Journal of Automata, Languages and Combinatorics, 2004

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2004

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages.
Proceedings of the Developments in Language Theory, 2004

Pushdown Information.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003
Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity.
Fundam. Inform., 2003

On the Number of Components in Cooperating Distributed Grammar Systems.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

On Iterated Sequential Transducers.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
On the Computational Complexity of Synchronized Context-Free Languages.
J. UCS, 2002

On Descriptions of Context-Free Languages by CD Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2002

Economy of Descriptions for Basic Constructions on Rational Transductions.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001
On the Number of Active Symbols in L and CD Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2001

On Descriptions of Context-Free Languages by CD Grammar Systems.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

2000
Grammar Systems with Negated Conditions in their Cooperation Protocols
J. UCS, 2000

Parallel Communicating Grammar Systems As Language Analyzers.
Grammars, 2000

1999
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems.
Inf. Process. Lett., 1999

On Accepting Pure Lindenmayer Systems.
Fundam. Inform., 1999

CD Grammar Systems Versus L Systems.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Grammar Systems as Language Analyzers and Recursively Enumerable Languages.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Cooperating distributed grammar systems with non-terminating components.
Proceedings of the Developments in Language Theory, 1999

1997
A Grammatical Approach to the LBA Problem.
Proceedings of the New Trends in Formal Languages, 1997

1996
Accepting Grammars and Systems via Context Condition Grammars.
Journal of Automata, Languages and Combinatorics, 1996

Accepting Multi-Agent Systems.
Computers and Artificial Intelligence, 1996

On Competence and Completeness in CD Grammar Systems.
Acta Cybern., 1996

1995
Accepting Grammars and Systems: An Overview.
Proceedings of the Developments in Language Theory II, 1995

1993
A Note on the Degree of Nondeterminism.
Proceedings of the Developments in Language Theory, 1993

1992
Über den Determiniertheitsgrad reiner Versionen formaler Sprachen.
PhD thesis, 1992

Pure Languages and the Degree of Nondeterminism.
Elektronische Informationsverarbeitung und Kybernetik, 1992


  Loading...