35 search results - page 4 / 7 » lata 2009 |
LATA
2009
Springer
14 years 3 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...
LATA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The present paper surveys recent developments in algorithmic teaching. First, the traditional teaching dimension model is recalled. Starting from the observation that the...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...