Конечные деревоавтоматы

In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic sec- ond order (MSO) …...

Parsing for a wide variety of grammar for- malisms can be performed by intersecting finite tree automata. However, naive im- plementations of parsing by intersection are very inefficient. We present …...