nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A disambiguation algorithm for weighted automata
|
Mohri, Mehryar |
|
2017 |
679 |
C |
p. 53-68 16 p. |
artikel |
2 |
Characterization and complexity results on jumping finite automata
|
Fernau, Henning |
|
2017 |
679 |
C |
p. 31-52 22 p. |
artikel |
3 |
Concatenation-free languages
|
Kutrib, Martin |
|
2017 |
679 |
C |
p. 83-94 12 p. |
artikel |
4 |
Editorial Board
|
|
|
2017 |
679 |
C |
p. iii-ix nvt p. |
artikel |
5 |
Inferring local transition functions of discrete dynamical systems from observations of system behavior
|
Adiga, Abhijin |
|
2017 |
679 |
C |
p. 126-144 19 p. |
artikel |
6 |
More on deterministic and nondeterministic finite cover automata
|
Gruber, Hermann |
|
2017 |
679 |
C |
p. 18-30 13 p. |
artikel |
7 |
On the hierarchy of generalizations of one-unambiguous regular languages
|
Caron, Pascal |
|
2017 |
679 |
C |
p. 95-106 12 p. |
artikel |
8 |
On the semantics of regular expression parsing in the wild
|
Berglund, Martin |
|
2017 |
679 |
C |
p. 69-82 14 p. |
artikel |
9 |
Preface
|
Drewes, Frank |
|
2017 |
679 |
C |
p. 1- 1 p. |
artikel |
10 |
Shift-invariant topologies for the Cantor space X ω
|
Hoffmann, Stefan |
|
2017 |
679 |
C |
p. 145-161 17 p. |
artikel |
11 |
State complexity of prefix distance
|
Ng, Timothy |
|
2017 |
679 |
C |
p. 107-117 11 p. |
artikel |
12 |
Survey: Finite-state technology in natural language processing
|
Maletti, Andreas |
|
2017 |
679 |
C |
p. 2-17 16 p. |
artikel |
13 |
Undecidability of the emptiness problem for context-free picture languages
|
Průša, Daniel |
|
2017 |
679 |
C |
p. 118-125 8 p. |
artikel |