Publikace na Matematicko-fyzikální fakulta, Ústřední knihovna |
2000
Abstrakt
We introduce normal restarting automata and contextual grammars with regular selection. Both of them allow to describe syntax of (natural) language as reduction systems.
We introduce normal restarting automata and contextual grammars with regular selection. Both of them allow to describe syntax of (natural) language as reduction systems.