| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Absolute convergence of rational series is semi-decidable
|
Bailly, Raphaël
|
|
2011
|
209 |
3 |
p. 280-295
16 p.
|
article
|
| 2 |
A classification of the expressive power of well-structured transition systems
|
Abdulla, Parosh Aziz
|
|
2011
|
209 |
3 |
p. 248-279
32 p.
|
article
|
| 3 |
Bounded hairpin completion
|
Ito, Masami
|
|
2011
|
209 |
3 |
p. 471-485
15 p.
|
article
|
| 4 |
Building species trees from larger parts of phylogenomic databases
|
Scornavacca, C.
|
|
2011
|
209 |
3 |
p. 590-605
16 p.
|
article
|
| 5 |
Computational complexity of the problem of tree generation under fine-grained access control policies
|
Moore, Neil
|
|
2011
|
209 |
3 |
p. 548-567
20 p.
|
article
|
| 6 |
Decidability of operation problems for T0L languages and subclasses
|
Bordihn, Henning
|
|
2011
|
209 |
3 |
p. 344-352
9 p.
|
article
|
| 7 |
Decision problems for convex languages
|
Brzozowski, Janusz
|
|
2011
|
209 |
3 |
p. 353-367
15 p.
|
article
|
| 8 |
Descriptional and computational complexity of finite automata—A survey
|
Holzer, Markus
|
|
2011
|
209 |
3 |
p. 456-470
15 p.
|
article
|
| 9 |
Editorial Board (continued)
|
|
|
2011
|
209 |
3 |
p. i-
1 p.
|
article
|
| 10 |
Efficiency of the symmetry bias in grammar acquisition
|
Matoba, Ryuichi
|
|
2011
|
209 |
3 |
p. 536-547
12 p.
|
article
|
| 11 |
Finite identification from the viewpoint of epistemic update
|
Dégremont, Cédric
|
|
2011
|
209 |
3 |
p. 383-396
14 p.
|
article
|
| 12 |
Hypothesis spaces for learning
|
Jain, Sanjay
|
|
2011
|
209 |
3 |
p. 513-527
15 p.
|
article
|
| 13 |
Inside Front Cover: Editorial Board
|
|
|
2011
|
209 |
3 |
p. IFC-
1 p.
|
article
|
| 14 |
Larger lower bounds on the OBDD complexity of integer multiplication
|
Bollig, Beate
|
|
2011
|
209 |
3 |
p. 333-343
11 p.
|
article
|
| 15 |
Limitations of lower bound methods for deterministic nested word automata
|
Salomaa, Kai
|
|
2011
|
209 |
3 |
p. 580-589
10 p.
|
article
|
| 16 |
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality
|
Fujioka, Kaoru
|
|
2011
|
209 |
3 |
p. 397-408
12 p.
|
article
|
| 17 |
Optimal simulation of self-verifying automata by deterministic automata
|
Jirásková, Galina
|
|
2011
|
209 |
3 |
p. 528-535
8 p.
|
article
|
| 18 |
Proof systems that take advice
|
Beyersdorff, Olaf
|
|
2011
|
209 |
3 |
p. 320-332
13 p.
|
article
|
| 19 |
Queries on Xml streams with bounded delay and concurrency
|
Gauwin, Olivier
|
|
2011
|
209 |
3 |
p. 409-442
34 p.
|
article
|
| 20 |
3rd International Conference on Language and Automata Theory and Applications (LATA 2009)
|
Martín-Vide, Carlos
|
|
2011
|
209 |
3 |
p. 247-
1 p.
|
article
|
| 21 |
Rigid tree automata and applications
|
Jacquemard, Florent
|
|
2011
|
209 |
3 |
p. 486-512
27 p.
|
article
|
| 22 |
Synchronizing automata with finitely many minimal synchronizing words
|
Pribavkina, Elena V.
|
|
2011
|
209 |
3 |
p. 568-579
12 p.
|
article
|
| 23 |
Teaching randomized learners with feedback
|
Balbach, Frank J.
|
|
2011
|
209 |
3 |
p. 296-319
24 p.
|
article
|
| 24 |
The efficiency of identifying timed automata and the power of clocks
|
Verwer, Sicco
|
|
2011
|
209 |
3 |
p. 606-625
20 p.
|
article
|
| 25 |
The fault tolerance of NP-hard problems
|
Glaßer, Christian
|
|
2011
|
209 |
3 |
p. 443-455
13 p.
|
article
|
| 26 |
The role of evolutionary operations in accepting hybrid networks of evolutionary processors
|
Dassow, Jürgen
|
|
2011
|
209 |
3 |
p. 368-382
15 p.
|
article
|
Journal description