37 search results - page 2 / 8 » fuin 2010 |
FUIN
2010
13 years 4 months ago
2010
FUIN
2010
13 years 3 months ago
2010
It is shown that the emptiness problem for 2-PA languages is undecidable and that 2-PA are weaker than 3-PA.
FUIN
2010
13 years 3 months ago
2010
We study 0-1 laws for extensions of first-order logic by Lindstr
FUIN
2010
13 years 3 months ago
2010
The construction of an associative -product of traces from an earlier paper is revisited using projection representation of traces. Using projections instead of trace prefixes res...
FUIN
2010
13 years 4 months ago
2010
In this paper we will provide a detailed proof of the solvability of the halting and reachability problem for binary 2-tag systems. We will furthermore prove that an important sub...