Some formal results about stratificational grammars and their relevance to linguistics
From MaRDI portal
Publication:3968471
DOI10.1007/BF01744567zbMath0502.68021MaRDI QIDQ3968471
Publication date: 1983
Published in: Mathematical Systems Theory (Search for Journal in Brave)
descriptional complexitygenerative powerSzilard languagescontrol grammarscomplexity of recognitionformal model for stratificational linguistics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparing complexity classes
- A recursive and a grammatical characterization of the exponential-time languages
- Control sets on context-free grammar forms
- Economy of description by parsers, DPDA's, and PDA's
- Left-derivation bounded languages
- On the generative power of transformational grammars
- Reversal-Bounded Acceptors and Intersections of Linear Languages
- Three models for the description of language
- Control sets on grammars
- Syntax-Directed Transduction
- Quasi-realtime languages
- Associate languages and derivational complexity of formal grammars and languages
This page was built for publication: Some formal results about stratificational grammars and their relevance to linguistics