default search action
Theoretical Computer Science, Volume 870
Volume 870, May 2021
- Lila Kari:
Editorial. iii - Galina Jirásková, Cezar Câmpeanu:
Special Issue on Implementation and Application of Automata. 1-2 - Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta:
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. 3-28 - Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki:
A general architecture of oritatami systems for simulating arbitrary finite automata. 29-52 - Michal Hospodár:
Power, positive closure, and quotients on convex languages. 53-74 - Christos A. Kapoutsis, Mohammad Zakzok:
Alternation in two-way finite automata. 75-102 - Stavros Konstantinidis, Nelma Moreira, Rogério Reis:
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. 103-120 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-driven multi-counter automata. 121-136 - Frantisek Mráz, Daniel Prusa, Michael Wehar:
Two-dimensional pattern matching against local and regular-like picture languages. 137-152 - Taylor J. Smith, Kai Salomaa:
Decision problems and projection languages for restricted variants of two-dimensional automata. 153-164 - Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano:
Streaming ranked-tree-to-string transducers. 165-187
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.