Publications

12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Debrecen, Hungary, August 26-27, 2022. Proceedings - Preface
H. Bordihn, G. Horváth, G. Vaszil (eds)
EPTCS, 367, 2022
Multi-Wave Soliton Automata
H. Bordihn, H. Jürgensen
J. Autom. Lang. Comb., 27, 1-3, 91-130, 2022
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
H. Bordihn, G. Vaszil
Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings, Lecture Notes in Computer Science, 4639, 113-124, Springer, 2007
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems
H. Bordihn, M. Holzer
Inf. Process. Lett., 69, 2, 59-62, 1999
Further Properties of Self-assembly by Hairpin Formation
H. Bordihn, V. Mitrana, A. Păun, M. Păun
Unconventional Computation and Natural Computation - 18th International Conference, UCNC 2019, Tokyo, Japan, June 3-7, 2019, Proceedings, Lecture Notes in Computer Science, 11493, 37-51, Springer, 2019
On leftmost derivations in CD grammar systems
H. Bordihn, G. Vaszil
LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications, Report 35/07, 187-198, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, 2007
On the degrees of non-regularity and non-context-freeness
H. Bordihn, V. Mitrana
J. Comput. Syst. Sci., 108, 104-117, 2020
Networks of Polarized Splicing Processors
H. Bordihn, V. Mitrana, A. Păun, M. Păun
Theory and Practice of Natural Computing - 6th International Conference, TPNC 2017, Prague, Czech Republic, December 18-20, 2017, Proceedings, Lecture Notes in Computer Science, 10687, 165-177, Springer, 2017
Non-classical models of automata and applications VIII - Preface
H. Bordihn, B. Nagy, G. Vaszil
RAIRO Theor. Informatics Appl., 52, 2-3-4, 87-88, 2018
Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity
S. Aydin, H. Bordihn
Fundam. Informaticae, 55, 3-4, 243-254, 2003
Small networks of polarized splicing processors are universal
H. Bordihn, V. Mitrana, M.C. Negru, A. Păun, M. Păun
Nat. Comput., 17, 4, 799-809, 2018
Networks of picture processors as problem solvers
H. Bordihn, P. Bottoni, A. Labella, V. Mitrana
Soft Comput., 21, 19, 5529-5541, 2017
On some deterministic grammars with regulation
H. Bordihn
Proceedings of the 5. Intern. Meeting of Young Computer Scientists (IMYCS'88), pages 87-93, Computer and Automation Institute, Hungarian Academy of Sciences, 1988
Hairpin completions and reductions: semilinearity properties
H. Bordihn, V. Mitrana, A. Păun, M. Păun
Nat. Comput., 20, 2, 193-203, 2021
Cooperating distributed grammar systems with non-terminating components
H. Bordihn, M. Holzer
Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999, pages 305-315, World Scientific, 1999
On Lindenmayer Systems with Dynamic Control of Parallelism
H. Bordihn, G. Vaszil
J. Autom. Lang. Comb., 21, 1-2, 27-40, 2016
Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings
H. Bordihn, R. Freund, B. Nagy, G. Vaszil (eds)
books@ocg.at, 321, Österreichische Computer Gesellschaft, 2016
Ambiguity of the Multiple Interpretations on Regular Languages
P.P. Alarcón, F. Arroyo, H. Bordihn, V. Mitrana, M. Müller
Fundam. Informaticae, 138, 1-2, 85-95, 2015
On the Computational Capacity of Parallel Communicating Finite Automata
H. Bordihn, M. Kutrib, A. Malcher
Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, Lecture Notes in Computer Science, 5257, 146-157, Springer, 2008
Foundations of Semantics and Model Checking in a Software Engineering Course
H. Bordihn, A.. Lamprecht, T. Margaria
Proceedings of the First Workshop on Formal Methods in Software Engineering Education and Training, FMSEE&T 2015, co-located with 20th International Symposium on Formal Methods (FM 2015), Oslo, Norway, June 23, 2015, CEUR Workshop Proceedings, 1385, 19-26, CEUR-WS.org, 2015
Nonterminal Controlled String Assembling Systems
H. Bordihn, M. Kutrib, M. Wendlandt
J. Autom. Lang. Comb., 19, 1-4, 33-44, 2014
Soliton Automata with Multiple Waves
H. Bordihn, H. Jürgensen, H. Ritter
Computing with New Resources - Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday, Lecture Notes in Computer Science, 8808, 32-48, Springer, 2014
Two Variants of Synchronized Shuffle on Backbones
H. Bordihn, F. Manea, V. Mitrana, D.. Voinescu
Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005), pages 77-87, The Publishing House of the Romanian Academy, 2014
Solving 2D-Pattern Matching with Networks of Picture Processors
H. Bordihn, P. Bottoni, A. Labella, V. Mitrana
Theory and Practice of Natural Computing - Third International Conference, TPNC 2014, Granada, Spain, December 9-11, 2014. Proceedings, Lecture Notes in Computer Science, 8890, 157-168, Springer, 2014
Measuring Communication in Parallel Communicating Finite Automata
H. Bordihn, M. Kutrib, A. Malcher
Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014, EPTCS, 151, 124-138, 2014
On the Computational Capacity of Parallel Communicating Finite Automata
H. Bordihn, M. Kutrib, A. Malcher
Int. J. Found. Comput. Sci., 23, 3, 713-732, 2012
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata
H. Bordihn, M. Kutrib, A. Malcher
Int. J. Found. Comput. Sci., 22, 7, 1577-1592, 2011
On deterministic grammars with valuations
H. Bordihn
Wissenschaftliche Zeitschrift der Techn. Universität Magdeburg, 31, 1-3, 1987
Preface
H. Bordihn, R. Freund, M. Hirvensalo, M. Holzer, M. Kutrib, F. Otto
Fundam. Informaticae, 112, 2-3, 2011
Determination of finite automata accepting subregular languages
H. Bordihn, M. Holzer, M. Kutrib
Theor. Comput. Sci., 410, 35, 3209-3222, 2009
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata
H. Bordihn, M. Kutrib, A. Malcher
Developments in Language Theory, 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings, Lecture Notes in Computer Science, 6224, 88-99, Springer, 2010
Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial
H. Bordihn, J. Dassow, M. Kutrib, B. Truthe
J. Autom. Lang. Comb., 16, 2-4, 71-74, 2011
Undecidability of Operation Problems for T0L Languages and Subclasses
H. Bordihn, M. Holzer, M. Kutrib
Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, Lecture Notes in Computer Science, 5457, 236-246, Springer, 2009
Extending regular expressions with homomorphic replacement
H. Bordihn, J. Dassow, M. Holzer
RAIRO Theor. Informatics Appl., 44, 2, 229-255, 2010
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities
H. Bordihn, M. Kutrib, A. Malcher
Int. J. Found. Comput. Sci., 26, 8, 1101-1126, 2015
Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings
H. Bordihn, R. Freund, M. Holzer, T. Hinze, M. Kutrib, F. Otto (eds)
books@ocg.at, 263, Austrian Computer Society, 2010
On input-revolving deterministic and nondeterministic finite automata
S. Bensch, H. Bordihn, M. Holzer, M. Kutrib
Inf. Comput., 207, 11, 1140-1155, 2009
Aspects in Language and Automata Theory Special Issue Dedicated to JÜrgen Dassow - Preface
H. Bordihn, B. Reichel, R. Stiebe, B. Truthe
Int. J. Found. Comput. Sci., 18, 6, 1137-1138, 2007
State Complexity of NFA to DFA Conversion of Subregular Language Families
H. Bordihn, M. Holzer, M. Kutrib
10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008, pages 85-96, University of Prince Edward Island, 2008
Hybrid Extended Finite Automata
H. Bordihn, M. Holzer, M. Kutrib
Int. J. Found. Comput. Sci., 18, 4, 745-760, 2007
Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings
H. Bordihn, R. Freund, M. Holzer, M. Kutrib, F. Otto (eds)
books@ocg.at, 256, Austrian Computer Society, 2009
Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited
H. Bordihn, M. Holzer
Fundam. Informaticae, 76, 3, 255-270, 2007
Hairpin Finite Automata
H. Bordihn, M. Holzer, M. Kutrib
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings, Lecture Notes in Computer Science, 4588, 108-119, Springer, 2007
Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday
H. Bordihn, M. Kutrib, B. Truthe (eds)
Lecture Notes in Computer Science, 7300, Springer, 2012
Deterministic Input-Reversal and Input-Revolving Finite Automata
S. Bensch, H. Bordihn, M. Holzer, M. Kutrib
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, Lecture Notes in Computer Science, 5196, 113-124, Springer, 2008
Programmed grammars and their relation to the LBA problem
H. Bordihn, M. Holzer
Acta Informatica, 43, 4, 223-242, 2006
Active Symbols in Pure Systems
S. Bensch, H. Bordihn
Fundam. Informaticae, 76, 3, 239-254, 2007
On the Computational Complexity of Synchronized Context-Free Languages
H. Bordihn, M. Holzer
J. Univers. Comput. Sci., 8, 2, 119-140, 2002
Hybrid Extended Finite Automata
H. Bordihn, M. Holzer, M. Kutrib
Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings, Lecture Notes in Computer Science, 4094, 34-45, Springer, 2006
On Descriptions of Context-Free Languages by CD Grammar Systems
H. Bordihn, B. Reichel
J. Autom. Lang. Comb., 7, 4, 447-454, 2002
Accepting Grammars and Systems via Context Condition Grammars
H. Bordihn, H. Fernau
J. Autom. Lang. Comb., 1, 2, 97-112, 1996
On Descriptions of Context-Free Languages by CD Grammar Systems
H. Bordihn, B. Reichel
Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20 - 22, 2001. Preproceedings, Preprint Nr. 16, 47-53, Fakultät für Informatik, Universität Magdeburg, Magdeburg, Germany, 2001
Unsolvability levels of operation problems for subclasses of context-free languages
H. Bordihn, M. Holzer, M. Kutrib
Int. J. Found. Comput. Sci., 16, 3, 423-440, 2005
Deterministic Lindenmayer Systems with Dynamic Control of Parallelism
H. Bordihn, G. Vaszil
Int. J. Found. Comput. Sci., 31, 1, 37-51, 2020
Reversible parallel communicating finite automata systems
H. Bordihn, G. Vaszil
Acta Informatica, 58, 4, 263-279, 2021
On the Number of Active Symbols in L and CD Grammar Systems
H. Bordihn, M. Holzer
J. Autom. Lang. Comb., 6, 4, 411-426, 2001
Iterated sequential transducers as language generating devices
H. Bordihn, H. Fernau, M. Holzer, V. Manca, C. Martín-Vide
Theor. Comput. Sci., 369, 1-3, 67-81, 2006
Revolving-Input Finite Automata
H. Bordihn, M. Holzer, M. Kutrib
Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings, Lecture Notes in Computer Science, 3572, 168-179, Springer, 2005
Economy of Description for Basic Constructions on Rational Transductions
H. Bordihn, M. Holzer, M. Kutrib
J. Autom. Lang. Comb., 9, 2/3, 175-188, 2004
Über deterministische Grammatiken mit Bewertungen
H. Bordihn
Diplomarbeit, Techn. Hochschule 'Otto-von-Guericke' Magdeburg, 1986
Accepting Grammars and Systems: An Overview
H. Bordihn, H. Fernau
Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995, pages 199-208, World Scientific, Singapore, 1995
On active symbols in CD grammar systems
H. Bordihn, B. Sunckel
7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings, pages 63-74, Università degli Studi di Milano, Milan, Italy, 2005
Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages
H. Bordihn, M. Holzer, M. Kutrib
Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, Lecture Notes in Computer Science, 3340, 102-113, Springer, 2004
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages
H. Bordihn, M. Holzer, M. Kutrib
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, Lecture Notes in Computer Science, 3317, 68-79, Springer, 2004
On some deterministic grammars with regulated rewriting
H. Bordihn
Analele Universitactii Bucarecsti, XXXIX-XL, 3, 35-48, 1992
Pushdown Information
H. Bordihn, H. Jürgensen
6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings, Report No. 619, 111-120, Department of Computer Science, The University of Western Ontario, Canada, 2004
Economy of Descriptions for Basic Constructions on Rational Transductions
H. Bordihn, M. Holzer, M. Kutrib
Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21 - 24, 2002. Pre-proceedings, Report No. 586, 55-69, Department of Computer Science, The University of Western Ontario, Canada, 2002
Decidability of operation problems for T0L languages and subclasses
H. Bordihn, M. Holzer, M. Kutrib
Inf. Comput., 209, 3, 344-352, 2011
Information, Codes, and Languages - Preface
S. Bensch, H. Bordihn
J. Autom. Lang. Comb., 23, 1-3, 3-4, 2018
On Accepting Pure Lindenmayer Systems
H. Bordihn, H. Fernau, M. Holzer
Fundam. Informaticae, 38, 4, 365-375, 1999
A Grammatical Approach to the LBA Problem
H. Bordihn
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday), Lecture Notes in Computer Science, 1218, 1-9, Springer, 1997
Descriptional Complexity of Restricted CD Grammar Systems
H. Bordihn, B. Sunckel
J. Autom. Lang. Comb., 14, 1, 7-22, 2009
Grammar Systems with Negated Conditions in their Cooperation Protocols
H. Bordihn, M. Holzer
J. Univers. Comput. Sci., 6, 12, 1165-1184, 2000
Hairpin Finite Automata
H. Bordihn, M. Holzer, M. Kutrib
J. Autom. Lang. Comb., 16, 2-4, 91-107, 2011
A note on cooperating distributed grammar systems working in combined modes
H. Bordihn, M. Holzer
Inf. Process. Lett., 108, 1, 10-14, 2008
On Active Symbols in CD Grammar Systems
H. Bordihn, B. Sunckel
J. Autom. Lang. Comb., 12, 1-2, 49-67, 2007
Grammar Systems as Language Analyzers and Recursively Enumerable Languages
H. Bordihn, J. Dassow, G. Vaszil
Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings, Lecture Notes in Computer Science, 1684, 136-147, Springer, 1999
Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems
H. Bordihn, M. Holzer
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, Lecture Notes in Computer Science, 5196, 125-136, Springer, 2008
On Iterated Sequential Transducers
H. Bordihn, H. Fernau, M. Holzer
Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back: Essays in Honour of Gheorghe Păun, Topics in Computer Mathematics, 9, 121-130, Taylor and Francis, 2003
On the Number of Active States in Deterministic and Nondeterministic Finite Automata
H. Bordihn, M. Holzer
Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings, Lecture Notes in Computer Science, 10329, 40-51, Springer, 2017
On the number of active states in finite automata
H. Bordihn, M. Holzer
Acta Informatica, 58, 4, 301-318, 2021
Parallel Communicating Grammar Systems As Language Analyzers
H. Bordihn, J. Dassow, G. Vaszil
Grammars, 3, 1, 1-20, 2000
CD Grammar Systems Versus L Systems
H. Bordihn, E. Csuhaj-Varjú, J. Dassow
Grammatical Models of Multi-Agent Systems, Topics in Computer Mathematics, 8, 18-32, Gordon and Breach Science Publishers, 1999
Über den Determiniertheitsgrad reiner Versionen formaler Sprachen
H. Bordihn
Dissertation, Technische Hochschule Magdeburg, Germany, 1992
On Competence and Completeness in CD Grammar Systems
H. Bordihn, E. Csuhaj-Varjú
Acta Cybern., 12, 4, 347-360, 1996
Accepting Multi-Agent Systems
H. Fernau, M. Holzer, H. Bordihn
Comput. Artif. Intell., 15, 2-3, 123-139, 1996
The Degree of Parallelism
H. Bordihn, H. Fernau
J. Autom. Lang. Comb., 12, 1-2, 25-47, 2007
Remarks on accepting parallel systems
H. Fernau, H. Bordihn
Int. J. Comput. Math., 56, 1-2, 51-67, 1995
The degree of parallelism
H. Bordihn, H. Fernau
7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings, pages 51-62, Università degli Studi di Milano, Milan, Italy, 2005
A Note on the Degree of Nondeterminism
H. Bordihn, J. Dassow
Developments in Language Theory, At the Crossroads of Mathematics, Computer Science and Biology, Turku, Finland, 12-15 July 1993, pages 70-80, World Scientific, Singapore, 1993
Pure Languages and the Degree of Nondeterminism
H. Bordihn
J. Inf. Process. Cybern., 28, 5, 231-240, 1992
Context-freeness of the power of context-free languages is undecidable
H. Bordihn
Theor. Comput. Sci., 314, 3, 445-449, 2004
On the Number of Components in Cooperating Distributed Grammar Systems
H. Bordihn
5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12 - 14, 2003. Proceedings, pages 81-89, MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, 2003
On the number of components in cooperating distributed grammar systems
H. Bordihn
Theor. Comput. Sci., 330, 2, 195-204, 2005
Active symbols in grammars with valuations
H. Bordihn
Theor. Comput. Sci., 682, 42-48, 2017
Contributions to the Syntactical Analysis Beyond Context-Freeness
H. Bordihn
Habilitation, Universität Potsdam, Germany, 2012