default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automata, Languages and Combinatorics, Volume 23
Volume 23, Numbers 1-3, 2018
- 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 G. 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 Gössel:
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
Volume 23, Number 4, 2018
- Henk Don, Hans Zantema:
Synchronizing Non-Deterministic Finite Automata. 307-328 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Properties of Language Classes Between Linear and Context-Free. 329-360 - Matthew McDevitt:
A Class of Rational Relations Generalising the Subword Order. 361-386 - Frantisek Mráz, Friedrich Otto:
On Deleting Deterministic Restarting Automata That Have Two Windows. 387-417
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.
last updated on 2025-12-09 23:40 CET 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:
