Abstract
This paper studies the representation of the derivations in phrase-structure grammars by the use of “derivation languages.” The words in the derivation language of a grammar correspond exactly to the “syntactical graphs” of Loeckx (1970) . Furthermore, the derivation languages generalize the representation of context-free derivation trees in prefix form. “Graph automata” are developed as acceptors of the derivation languages. The graph automata generalize the theory of tree automata as studied in connection with contextfree grammars.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
