default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenning Bordihn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i1]Henning Bordihn, Helena Schulz:
Determinism in Multi-Soliton Automata. CoRR abs/2409.06969 (2024)- 2023
- [e6]Henning Bordihn
, Nicholas Q. Tran, György Vaszil:
Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Lecture Notes in Computer Science 13918, Springer 2023, ISBN 978-3-031-34325-4 [contents] - 2022
- [j51]Henning Bordihn, Helmut Jürgensen:
Multi-Wave Soliton Automata. J. Autom. Lang. Comb. 27(1-3): 91-130 (2022) - [e5]Henning Bordihn, Géza Horváth, György Vaszil:
Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Debrecen, Hungary, August 26-27, 2022. EPTCS 367, 2022 [contents] - 2021
- [j50]Henning Bordihn, György Vaszil:
Reversible parallel communicating finite automata systems. Acta Informatica 58(4): 263-279 (2021) - [j49]Henning Bordihn, Markus Holzer:
On the number of active states in finite automata. Acta Informatica 58(4): 301-318 (2021) - [j48]Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun:
Hairpin completions and reductions: semilinearity properties. Nat. Comput. 20(2): 193-203 (2021) - 2020
- [j47]Henning Bordihn, György Vaszil:
Deterministic Lindenmayer Systems with Dynamic Control of Parallelism. Int. J. Found. Comput. Sci. 31(1): 37-51 (2020) - [j46]Henning Bordihn, Victor Mitrana:
On the degrees of non-regularity and non-context-freeness. J. Comput. Syst. Sci. 108: 104-117 (2020)
2010 – 2019
- 2019
- [c34]Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun:
Further Properties of Self-assembly by Hairpin Formation. UCNC 2019: 37-51 - 2018
- [j45]Henning Bordihn, Benedek Nagy, György Vaszil:
Preface: Non-classical models of automata and applications VIII. RAIRO Theor. Informatics Appl. 52(2-3-4): 87-88 (2018) - [j44]Suna Bensch, Henning Bordihn:
Information, Codes, and Languages - Preface. J. Autom. Lang. Comb. 23(1-3): 3-4 (2018) - [j43]Henning Bordihn, Victor Mitrana, Maria C. Negru, Andrei Paun, Mihaela Paun:
Small networks of polarized splicing processors are universal. Nat. Comput. 17(4): 799-809 (2018) - 2017
- [j42]Henning Bordihn, Paolo Bottoni, Anna Labella, Victor Mitrana:
Networks of picture processors as problem solvers. Soft Comput. 21(19): 5529-5541 (2017) - [j41]Henning Bordihn:
Active symbols in grammars with valuations. Theor. Comput. Sci. 682: 42-48 (2017) - [c33]Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun:
Networks of Polarized Splicing Processors. TPNC 2017: 165-177 - [c32]Henning Bordihn, Markus Holzer:
On the Number of Active States in Deterministic and Nondeterministic Finite Automata. CIAA 2017: 40-51 - 2016
- [j40]Henning Bordihn, György Vaszil:
On Lindenmayer Systems with Dynamic Control of Parallelism. J. Autom. Lang. Comb. 21(1-2): 27-40 (2016) - [e4]Henning Bordihn, Rudolf Freund, Benedek Nagy, György Vaszil:
Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings. books@ocg.at 321, Österreichische Computer Gesellschaft 2016, ISBN 978-3-903035-10-2 [contents] - 2015
- [j39]Pedro Pablo Alarcón, Fernando Arroyo, Henning Bordihn, Victor Mitrana, Mike Müller:
Ambiguity of the Multiple Interpretations on Regular Languages. Fundam. Informaticae 138(1-2): 85-95 (2015) - [j38]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. Int. J. Found. Comput. Sci. 26(8): 1101-1126 (2015) - [c31]Henning Bordihn, Anna-Lena Lamprecht, Tiziana Margaria:
Foundations of Semantics and Model Checking in a Software Engineering Course. FMSEE&T@FM 2015: 19-26 - 2014
- [j37]Henning Bordihn, Martin Kutrib, Matthias Wendlandt:
Nonterminal Controlled String Assembling Systems. J. Autom. Lang. Comb. 19(1-4): 33-44 (2014) - [c30]Henning Bordihn, Helmut Jürgensen, Heiko Ritter:
Soliton Automata with Multiple Waves. Computing with New Resources 2014: 32-48 - [c29]Henning Bordihn, Florin Manea, Victor Mitrana, Daniel-Claudian Voinescu:
Two Variants of Synchronized Shuffle on Backbones. Discrete Mathematics and Computer Science 2014: 77-87 - [c28]Henning Bordihn, Paolo Bottoni, Anna Labella, Victor Mitrana:
Solving 2D-Pattern Matching with Networks of Picture Processors. TPNC 2014: 157-168 - [c27]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Measuring Communication in Parallel Communicating Finite Automata. AFL 2014: 124-138 - 2012
- [b2]Henning Bordihn:
Contributions to the syntactical analysis beyond context-freeness (Beiträge zur syntaktischen Analyse nicht-kontextfreier Sprachen). University of Potsdam, Germany, 2012 - [j36]Henning Bordihn, Martin Kutrib, Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 23(3): 713-732 (2012) - [e3]Henning Bordihn, Martin Kutrib, Bianca Truthe:
Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 7300, Springer 2012, ISBN 978-3-642-31643-2 [contents] - 2011
- [j35]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto:
Preface. Fundam. Informaticae 112(2-3) (2011) - [j34]Henning Bordihn, Markus Holzer, Martin Kutrib:
Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011) - [j33]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 22(7): 1577-1592 (2011) - [j32]Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe:
Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial. J. Autom. Lang. Comb. 16(2-4): 71-74 (2011) - [j31]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hairpin Finite Automata. J. Autom. Lang. Comb. 16(2-4): 91-107 (2011) - 2010
- [j30]Henning Bordihn, Jürgen Dassow, Markus Holzer:
Extending regular expressions with homomorphic replacement. RAIRO Theor. Informatics Appl. 44(2): 229-255 (2010) - [c26]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99 - [e2]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. books@ocg.at 263, Austrian Computer Society 2010, ISBN 978-3-85403-263-2 [contents]
2000 – 2009
- 2009
- [j29]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib:
On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009) - [j28]Henning Bordihn, Bettina Sunckel:
Descriptional Complexity of Restricted CD Grammar Systems. J. Autom. Lang. Comb. 14(1): 7-22 (2009) - [j27]Henning Bordihn, Markus Holzer, Martin Kutrib:
Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009) - [c25]Henning Bordihn, Markus Holzer, Martin Kutrib:
Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246 - [e1]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. books@ocg.at 256, Austrian Computer Society 2009, ISBN 978-3-85403-256-4 [contents] - 2008
- [j26]Henning Bordihn, Markus Holzer:
A note on cooperating distributed grammar systems working in combined modes. Inf. Process. Lett. 108(1): 10-14 (2008) - [c24]Henning Bordihn, Markus Holzer, Martin Kutrib:
State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96 - [c23]Henning Bordihn, Martin Kutrib, Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory 2008: 146-157 - [c22]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib:
Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124 - [c21]Henning Bordihn, Markus Holzer:
Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. LATA 2008: 125-136 - 2007
- [j25]Suna Bensch, Henning Bordihn:
Active Symbols in Pure Systems. Fundam. Informaticae 76(3): 239-254 (2007) - [j24]Henning Bordihn, Markus Holzer:
Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. Fundam. Informaticae 76(3): 255-270 (2007) - [j23]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007) - [j22]Henning Bordihn, Bernd Reichel, Ralf Stiebe, Bianca Truthe:
Preface: Aspects in Language and Automata Theory Special Issue Dedicated to JÜrgen Dassow. Int. J. Found. Comput. Sci. 18(6): 1137-1138 (2007) - [j21]Henning Bordihn, Henning Fernau:
The Degree of Parallelism. J. Autom. Lang. Comb. 12(1-2): 25-47 (2007) - [j20]Henning Bordihn, Bettina Sunckel:
On Active Symbols in CD Grammar Systems. J. Autom. Lang. Comb. 12(1-2): 49-67 (2007) - [c20]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hairpin Finite Automata. Developments in Language Theory 2007: 108-119 - [c19]Henning Bordihn, György Vaszil:
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. FCT 2007: 113-124 - [c18]Henning Bordihn, György Vaszil:
On leftmost derivations in CD grammar systems. LATA 2007: 187-198 - 2006
- [j19]Henning Bordihn, Markus Holzer:
Programmed grammars and their relation to the LBA problem. Acta Informatica 43(4): 223-242 (2006) - [j18]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) - [c17]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hybrid Extended Finite Automata. CIAA 2006: 34-45 - 2005
- [j17]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) - [j16]Henning Bordihn:
On the number of components in cooperating distributed grammar systems. Theor. Comput. Sci. 330(2): 195-204 (2005) - [c16]Henning Bordihn, Henning Fernau:
The degree of parallelism. DCFS 2005: 51-62 - [c15]Henning Bordihn, Bettina Sunckel:
On active symbols in CD grammar systems. DCFS 2005: 63-74 - [c14]Henning Bordihn, Markus Holzer, Martin Kutrib:
Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179 - 2004
- [j15]Henning Bordihn, Markus Holzer, Martin Kutrib:
Economy of Description for Basic Constructions on Rational Transductions. J. Autom. Lang. Comb. 9(2/3): 175-188 (2004) - [j14]Henning Bordihn:
Context-freeness of the power of context-free languages is undecidable. Theor. Comput. Sci. 314(3): 445-449 (2004) - [c13]Henning Bordihn, Helmut Jürgensen:
Pushdown Information. DCFS 2004: 111-120 - [c12]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 - [c11]Henning Bordihn, Markus Holzer, Martin Kutrib:
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79 - 2003
- [j13]Suna Aydin, Henning Bordihn:
Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity. Fundam. Informaticae 55(3-4): 243-254 (2003) - [c10]Henning Bordihn, Henning Fernau, Markus Holzer:
On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130 - [c9]Henning Bordihn:
On the Number of Components in Cooperating Distributed Grammar Systems. DCFS 2003: 81-89 - 2002
- [j12]Henning Bordihn, Bernd Reichel:
On Descriptions of Context-Free Languages by CD Grammar Systems. J. Autom. Lang. Comb. 7(4): 447-454 (2002) - [j11]Henning Bordihn, Markus Holzer:
On the Computational Complexity of Synchronized Context-Free Languages. J. Univers. Comput. Sci. 8(2): 119-140 (2002) - [c8]Henning Bordihn, Markus Holzer, Martin Kutrib:
Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69 - 2001
- [j10]Henning Bordihn, Markus Holzer:
On the Number of Active Symbols in L and CD Grammar Systems. J. Autom. Lang. Comb. 6(4): 411-426 (2001) - [c7]Henning Bordihn, Bernd Reichel:
On Descriptions of Context-Free Languages by CD Grammar Systems. DCFS 2001: 47-53 - 2000
- [j9]Henning Bordihn, Jürgen Dassow, György Vaszil:
Parallel Communicating Grammar Systems As Language Analyzers. Grammars 3(1): 1-20 (2000) - [j8]Henning Bordihn, Markus Holzer:
Grammar Systems with Negated Conditions in their Cooperation Protocols. J. Univers. Comput. Sci. 6(12): 1165-1184 (2000)
1990 – 1999
- 1999
- [j7]Henning Bordihn, Henning Fernau, Markus Holzer:
On Accepting Pure Lindenmayer Systems. Fundam. Informaticae 38(4): 365-375 (1999) - [j6]Henning Bordihn, Markus Holzer:
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. Inf. Process. Lett. 69(2): 59-62 (1999) - [c6]Henning Bordihn, Markus Holzer:
Cooperating distributed grammar systems with non-terminating components. Developments in Language Theory 1999: 305-315 - [c5]Henning Bordihn, Jürgen Dassow, György Vaszil:
Grammar Systems as Language Analyzers and Recursively Enumerable Languages. FCT 1999: 136-147 - [c4]Henning Bordihn, Erzsébet Csuhaj-Varjú, Jürgen Dassow:
CD Grammar Systems Versus L Systems. Grammatical Models of Multi-Agent Systems 1999: 18-32 - 1997
- [c3]Henning Bordihn:
A Grammatical Approach to the LBA Problem. New Trends in Formal Languages 1997: 1-9 - 1996
- [j5]Henning Bordihn, Erzsébet Csuhaj-Varjú:
On Competence and Completeness in CD Grammar Systems. Acta Cybern. 12(4): 347-360 (1996) - [j4]Henning Fernau, Markus Holzer, Henning Bordihn:
Accepting Multi-Agent Systems. Comput. Artif. Intell. 15(2-3): 123-139 (1996) - [j3]Henning Bordihn, Henning Fernau:
Accepting Grammars and Systems via Context Condition Grammars. J. Autom. Lang. Comb. 1(2): 97-112 (1996) - 1995
- [j2]Henning Fernau, Henning Bordihn:
Remarks on accepting parallel systems. Int. J. Comput. Math. 56(1-2): 51-67 (1995) - [c2]Henning Bordihn, Henning Fernau:
Accepting Grammars and Systems: An Overview. Developments in Language Theory 1995: 199-208 - 1993
- [c1]Henning Bordihn, Jürgen Dassow:
A Note on the Degree of Nondeterminism. Developments in Language Theory 1993: 70-80 - 1992
- [b1]Henning Bordihn:
Über den Determiniertheitsgrad reiner Versionen formaler Sprachen. Technische Hochschule Magdeburg, Germany, 1992, pp. 1-97 - [j1]Henning Bordihn:
Pure Languages and the Degree of Nondeterminism. J. Inf. Process. Cybern. 28(5): 231-240 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
