no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Descriptional complexity of two-way pushdown automata with restricted head reversals
|
Malcher, Andreas |
|
2012 |
449 |
C |
p. 119-133 15 p. |
article |
2 |
Editorial Board
|
|
|
2012 |
449 |
C |
p. iii-viii nvt p. |
article |
3 |
Efficient unfolding of contextual Petri nets
|
Baldan, Paolo |
|
2012 |
449 |
C |
p. 2-22 21 p. |
article |
4 |
Geometrical regular languages and linear Diophantine equations: The strongly connected case
|
Champarnaud, Jean-Marc |
|
2012 |
449 |
C |
p. 54-63 10 p. |
article |
5 |
Language classes generated by tree controlled grammars with bounded nonterminal complexity
|
Turaev, Sherzod |
|
2012 |
449 |
C |
p. 134-144 11 p. |
article |
6 |
[No title]
|
Holzer, Markus |
|
2012 |
449 |
C |
p. 1- 1 p. |
article |
7 |
On a structural property in the state complexity of projected regular languages
|
Jirásková, Galina |
|
2012 |
449 |
C |
p. 93-105 13 p. |
article |
8 |
On external contextual grammars with subregular selection languages
|
Dassow, Jürgen |
|
2012 |
449 |
C |
p. 64-73 10 p. |
article |
9 |
On synchronized multi-tape and multi-head automata
|
Ibarra, Oscar H. |
|
2012 |
449 |
C |
p. 74-84 11 p. |
article |
10 |
Reversal of binary regular languages
|
Jirásková, Galina |
|
2012 |
449 |
C |
p. 85-92 8 p. |
article |
11 |
State complexity of operations on two-way finite automata over a unary alphabet
|
Kunc, Michal |
|
2012 |
449 |
C |
p. 106-118 13 p. |
article |
12 |
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
|
Brzozowski, Janusz |
|
2012 |
449 |
C |
p. 37-53 17 p. |
article |
13 |
The size-cost of Boolean operations on constant height deterministic pushdown automata
|
Bednárová, Zuzana |
|
2012 |
449 |
C |
p. 23-36 14 p. |
article |