Special Issues Dedicated to Helmut Jürgensen on the Occasion of his 75th Birthday
Suna Bensch, Henning Bordihn: | |
Information, Codes, and Languages – Preface | 3–4 |
Dávid Angyal, Benedek Nagy, György Vaszil: | |
On the Complexity of a Mildly Context-Sensitive Language Class | 5–18 |
Martin Berglund, Frank Drewes, Brink van der Merwe: | |
The Output Size Problem for String-to-Tree Transducers | 19–38 |
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis: | |
Position Automata for Semi-extended Expressions | 39–65 |
Janusz A. Brzozowski: | |
Towards a Theory of Complexity of Regular Languages | 67–101 |
Cristian S. Calude, Ludwig Staiger: | |
A Simple Construction of Absolutely Disjunctive Liouville Numbers | 103–109 |
Cezar Câmpeanu: | |
What is a Complex Regular Language? | 111–126 |
Mark Daley, Mark Eramian, Christopher Power, Ian McQuillan: | |
From Helmut Jürgensen's Former Students: The Game of Informatics Research | 127–141 |
Jürgen Dassow: | |
Grammars with Control by Ideals and Codes | 143–164 |
Maia Hoeberechts: | |
Computational Requirements Hidden Behind Encodings | 165–188 |
Oscar H. Ibarra, Ian McQuillan: | |
On the Density of Languages Accepted by Turing Machines and Other Machine Models | 189–199 |
Lila Kari, Manasi S. Kulkarni, Kalpana Mahalingam: | |
Relative Watson-Crick Primitivity of Words | 201–217 |
Wiebke Köhlmann, Francis Zinke, Ulrike Lucke, Elnaz Mazandarani, Marlene Karlapp: | |
User Interface Filters for Tactile Braille Displays | 219–241 |
Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis: | |
Symbolic Manipulation of Code Properties | 243–269 |
Paul-Patrick Nordmann, Michael Goessel: | |
Regular LPDC Codes with Guaranteed Minimal Hamming Distance | 271–280 |
Alexandros Palioudakis, Yo-Sub Han, Kai Salomaa: | |
Growth Rate of Minimum Branching | 281–292 |
Arto Salomaa: | |
From Infinite to Finite by Identifying Variables in Many-Valued Logic | 293–301 |