Abstract
We present a formal model for stratificational linguistics, and examine its properties such as generative power, complexity of recognition and descriptional complexity. By relating stratificational grammars to control grammars and Szilard languages, we obtain a table of language families generated by stratificational grammars under several restrictions of linguistic interest. In the process, we show that context-sensitive control grammars with leftmost derivations are no more powerful than context-free ones, and, using this, resolve two open problems of Ginsburg and Spanier. Throughout the paper, formal results are interpreted in terms of their significance for linguistic theory and practice.
Sign-in/Register to access full text options 
Free) 
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
