Publication at Faculty of Mathematics and Physics, Central Library of Charles University |
2000
Abstract
We introduce normal restarting automata and contextual grammars with regular selection. Both of them allow to describe syntax of (natural) language as reduction systems.