default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 104
Volume 104, September 2019
- Adrian-Horia Dediu
, Carlos Martín-Vide, Bianca Truthe:
Special issue: Selected papers of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015. 1-4 - Eric Allender, Ian Mertz:
Complexity of regular functions. 5-16 - Marco Autili, Paola Inverardi, Romina Spalazzese, Massimo Tivoli, Filippo Mignosi:
Automated synthesis of application-layer connectors from automata-based specifications. 17-40 - Parvaneh Babari, Manfred Droste:
A Nivat theorem for weighted picture automata and weighted MSO logics. 41-57 - Raphaël Bailly, Guillaume Rabusseau, François Denis:
Recognizable series on graphs and hypergraphs. 58-81 - Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah:
A game characterisation of tree-like Q-Resolution size. 82-101 - Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Recurrence relations, succession rules and the positivity problem. 102-118 - Johanna Björklund, Frank Drewes, Niklas Zechner:
Efficient enumeration of weighted tree languages over the tropical semiring. 119-130 - Yohan Boichut, Jacques Chabin, Pierre Réty:
Towards more precise rewriting approximations. 131-148 - Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for unordered trees with data constraints. 149-164 - Bastien Cazaux, Thierry Lecroq, Eric Rivals:
Linking indexing data structures to de Bruijn graphs: Construction and update. 165-183 - Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp:
Sorting networks: To the end and back again. 184-201 - Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding clique-width via perfect graphs. 202-215 - H. K. Dai, Zhu Wang:
Two parallel algorithms for finding all minimal maximum subsequences. 216-243 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion operations on deterministic reversal-bounded counter machines. 244-257 - Guilhem Gamard, Gwénaël Richomme:
Coverability and multi-scale coverability on infinite pictures. 258-277 - Florent Jacquemard, Michaël Rusinowitch:
One-variable context-free hedge automata. 278-296 - Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Classifying invariant structures of step traces. 297-322 - Martin Sulzmann, Peter Thiemann:
Derivatives and partial derivatives for regular shuffle expressions. 323-341 - Vojtech Vorel, Adam Roman:
Complexity of road coloring with prescribed reset words. 342-358 - Ryo Yoshinaka:
Distributional learning of conjunctive grammars and contextual binary feature grammars. 359-374
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-03-24 00:26 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:
