Name
Abstract | ||
|---|---|---|
. In this paper we investigate the correspondence (in the styleof the well known Buchi Theorem) between !-languages accepted by systolicautomata and suitable (proper) extensions of the Monadic SecondOrder theory of one successor (MSO[!]). To this purpose we extendY -tree and trellis systolic automata to deal with !-words and we studythe expressiveness, closure and decidability properties of the two classesof !-languages accepted by Y -tree and trellis automata, respectively. Wedefine,... |
Year | Venue | DocType |
|---|---|---|
2001 | Acta Cybern. | Journal |
Volume | Issue | Citations |
15 | 1 | 1 |
PageRank | References | Authors |
0.36 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Angelo Monti | 1 | 671 | 46.93 |
| Adriano Peron | 2 | 381 | 45.82 |