| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A game characterisation of tree-like Q-Resolution size
|
Beyersdorff, Olaf
|
|
2019
|
104 |
C |
p. 82-101
|
article
|
| 2 |
A Nivat theorem for weighted picture automata and weighted MSO logics
|
Babari, Parvaneh
|
|
2019
|
104 |
C |
p. 41-57
|
article
|
| 3 |
Automated synthesis of application-layer connectors from automata-based specifications
|
Autili, Marco
|
|
2019
|
104 |
C |
p. 17-40
|
article
|
| 4 |
Bounding clique-width via perfect graphs
|
Dabrowski, Konrad K.
|
|
2019
|
104 |
C |
p. 202-215
|
article
|
| 5 |
Classifying invariant structures of step traces
|
Janicki, Ryszard
|
|
2019
|
104 |
C |
p. 297-322
|
article
|
| 6 |
Complexity of regular functions
|
Allender, Eric
|
|
2019
|
104 |
C |
p. 5-16
|
article
|
| 7 |
Complexity of road coloring with prescribed reset words
|
Vorel, Vojtěch
|
|
2019
|
104 |
C |
p. 342-358
|
article
|
| 8 |
Coverability and multi-scale coverability on infinite pictures
|
Gamard, Guilhem
|
|
2019
|
104 |
C |
p. 258-277
|
article
|
| 9 |
Derivatives and partial derivatives for regular shuffle expressions
|
Sulzmann, Martin
|
|
2019
|
104 |
C |
p. 323-341
|
article
|
| 10 |
Distributional learning of conjunctive grammars and contextual binary feature grammars
|
Yoshinaka, Ryo
|
|
2019
|
104 |
C |
p. 359-374
|
article
|
| 11 |
Editorial Board
|
|
|
2019
|
104 |
C |
p. ii
|
article
|
| 12 |
Efficient enumeration of weighted tree languages over the tropical semiring
|
Björklund, Johanna
|
|
2019
|
104 |
C |
p. 119-130
|
article
|
| 13 |
Insertion operations on deterministic reversal-bounded counter machines
|
Eremondi, Joey
|
|
2019
|
104 |
C |
p. 244-257
|
article
|
| 14 |
Linking indexing data structures to de Bruijn graphs: Construction and update
|
Cazaux, Bastien
|
|
2019
|
104 |
C |
p. 165-183
|
article
|
| 15 |
Logics for unordered trees with data constraints
|
Boiret, Adrien
|
|
2019
|
104 |
C |
p. 149-164
|
article
|
| 16 |
One-variable context-free hedge automata
|
Jacquemard, Florent
|
|
2019
|
104 |
C |
p. 278-296
|
article
|
| 17 |
Recognizable series on graphs and hypergraphs
|
Bailly, Raphaël
|
|
2019
|
104 |
C |
p. 58-81
|
article
|
| 18 |
Recurrence relations, succession rules and the positivity problem
|
Bilotta, S.
|
|
2019
|
104 |
C |
p. 102-118
|
article
|
| 19 |
Sorting networks: To the end and back again
|
Codish, Michael
|
|
2019
|
104 |
C |
p. 184-201
|
article
|
| 20 |
Special issue: Selected papers of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015
|
Dediu, Adrian-Horia
|
|
2019
|
104 |
C |
p. 1-4
|
article
|
| 21 |
Towards more precise rewriting approximations
|
Boichut, Yohan
|
|
2019
|
104 |
C |
p. 131-148
|
article
|
| 22 |
Two parallel algorithms for finding all minimal maximum subsequences
|
Dai, H.K.
|
|
2019
|
104 |
C |
p. 216-243
|
article
|
Journal description