ract State Machines Be Useful in Language Theory? Yuri Gurevich a Margus Veanes a Charles Wallace b aMicrosoft Research, Redmond, Washington, USA bMichigan Tech, Houghton, Michigan...
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
After brie y reviewing the basic notions and terminology of active rules and relating them to production rules and deductive rules, respectively, we survey a number of formal appro...
We focus on the probleln of building large repositories of le.rical coJtceplual structure (LCS) representations for verbs in multiple languages. One of the main results of this wo...