Автор |
Rosenthal, Kimmo I. |
Дата выпуска |
1994 |
dc.description |
In this article, we indicate how the category theoretical approach to tree automata, due to Betti and Kasangian, can be fruitfully combined with Walters’ categorical approach to context-free grammars to provide a simple way of establishing the well-known correspondence between context-free languages and the behaviors of non-deterministic tree automata. The connecting link between the two notions is provided by the theory of relational presheaves. |
Формат |
application.pdf |
Издатель |
Cambridge University Press |
Копирайт |
Copyright © Cambridge University Press 1994 |
Название |
A categorical look at tree automata and context-free languages |
Тип |
research-article |
DOI |
10.1017/S0960129500000487 |
Electronic ISSN |
1469-8072 |
Print ISSN |
0960-1295 |
Журнал |
Mathematical Structures in Computer Science |
Том |
4 |
Первая страница |
287 |
Последняя страница |
293 |
Аффилиация |
Rosenthal Kimmo I.; Union College |
Выпуск |
3 |