Topic
Linear grammar
About: Linear grammar is a research topic. Over the lifetime, 55 publications have been published within this topic receiving 646 citations.
Papers published on a yearly basis
Papers
TL;DR: By constructing a generator for the family of linear indexed languages, it is shown that this family is a full principal semi-AFL and a Parikh theorem forlinear indexed languages implies that there are indexed languages which are not linear.
53 citations
Book•
9 Dec 2010
TL;DR: The organisation of spoken discourse and the psychological foundations of the grammar are discussed, as well as key and termination within and between increments.
Abstract: 1. Introduction: the organisation of spoken discourse 2. A review of A Grammar of Speech 3. The psychological foundations of the grammar 4. A linear grammar of speech 5. The corpus and its coding 6. Increments and tone 7. Key and termination within and between increments 8. Reviewing, looking forward and practical applications Bibliography Index.
32 citations
TL;DR: There exists a language L sub 0 which is generated by a linear grammar and is not T(n)-recognizable by any on-line multi-tape Turing machine if lim T( n)/(n/logn) squared (as n approaches infinity) equals zero.
Abstract: : It is shown that (1) there exists a language L sub 0 which is generated by a linear grammar and is not T(n)-recognizable by any on-line multi-tape Turing machine if lim T(n)/(n/logn) squared (as n approaches infinity) equals zero and (2) any language generated by a linear grammar is n squared-recognizable by an on-line single-tape Turing machine in the sense of Hartmanis and Stearns (Computational complexity of recursive sequences, Proc. the Fifth Annual Symp. of Switching Circuit Theory and Logical Design, p. 82-90 (1964)). (Author)
29 citations
TL;DR: The approach makes it possible to reduce the problem of inferring the structure of a context-free grammar back to the normal grammatical inference problem.
27 citations
TL;DR: All languages generated by context-free returning parallel communicating grammar systems can also be generated by such systems having only rules of the form X → α, where α consists of at most two symbols and if X → X is a query rule, then α is a single query symbol.
24 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2019 | 1 |
| 2017 | 1 |
| 2016 | 1 |
| 2015 | 2 |
| 2013 | 1 |
| 2011 | 2 |