Filters








149,835 Hits in 5.2 sec

Cumulative subject index volumes 44–47

1980 Information and Control  
, 45, 34 Bounded deterministic languages context-free, characterization theorem for, 47, 220 Broadcast channels partial feedback for, 46, 1 Burst distribution of coset of linear code, 44, 73 C Capacity  ...  general linear equivalences of, 45, 156 Bound for binary codes outside Plotkin range, 47, 85 Griessner, codes meeting: uniqueness respecting nonexistence of, 44, 16 upper, for difference between two entropies  ...  linear, mismatch robustness of: relation- ship to coding, 47, 237 Prefix-free context-free languages derivatives and quotients of, 45, 229 Probability distributions general, entropy of: new definition  ... 
doi:10.1016/s0019-9958(80)90592-6 fatcat:zwdwzq5kifakzlpgfkl5hog2ra

Page 2803 of Mathematical Reviews Vol. , Issue 81G [page]

1981 Mathematical Reviews  
Systems Theory 4 (1970), 257-287; MR 42 #4336] has defined the class of context- free tree languagés and proved its closure properties under linear homomorphism and intersection with regular sets of trees  ...  The author gives a context-free language which is not a generator (in the AFL sense) of the family of context-free languages, is not in the substitution closure of the linear context-free languages (i.e  ... 

Page 745 of Mathematical Reviews Vol. 38, Issue 4 [page]

1969 Mathematical Reviews  
Gross (Paris) Rosenberg, Arnold L. 4231 On the independence of real-time definability and certain structural properties of context-free languages. J. Assoc. Comput. Mach. 15 (1968), 672-679.  ...  A bracketed context-free language (B-language) is ob- tained when, starting with a context-free grammar G = (V,=, P, oc), one annexes to the set = of terminals two new families of symbols: £,; and X,,  ... 

Page 512 of Mathematical Reviews Vol. , Issue 2004a [page]

2004 Mathematical Reviews  
We show that the gap between the time complexity and space complexity, respectively, of a language and that of its root can be arbitrarily great.  ...  A context free grammar is linear if the right side of each rule contains at most one non-terminal.  ... 

Page 951 of Mathematical Reviews Vol. 55, Issue 3 [page]

1978 Mathematical Reviews  
of three context-free languages.  ...  each limited to one reversal, and hence can be expressed as the length-preserving homomorphic image of the intersection of three linear context-free languages.  ... 

On the Generative Power of Multiple Context-Free Grammars and Macro Grammars

H. SEKI, Y. KATO
2008 IEICE transactions on information and systems  
Several grammars of which generative power is between context-free grammar and context-sensitive grammar were proposed. Among them are macro grammar and tree adjoining grammar.  ...  In this paper, the generative power of several subclasses of variable-linear macro grammars and that of multiple context-free grammars are compared in details.  ...  Introduction Several grammars of which generative power is between context-free grammar (cfg) and context-sensitive grammar (csg) were proposed.  ... 
doi:10.1093/ietisy/e91-d.2.209 fatcat:b6zbfywfhbfubjkpqod6apepfm

On the complexities of linear LL(1) and LR(1) grammars [chapter]

Markus Holzer, Klaus -Jörn Lange
1993 Lecture Notes in Computer Science  
We exhibit close relationships between simple linear languages and the deterministic linear languages both according to Nasu and Honda and to Ibarra, Jiang, and Ravikumar.  ...  Several notions of deterministic linear languages are considered and compared with respect to their complexities and to the families of formal languages they generate.  ...  In contrast to that both the deterministic linear languages according to Ibarra, Jiang, and Ravikumar 10] and those according to Nasu and Honda 15] are based on linear grammars restricted by an LL(1)  ... 
doi:10.1007/3-540-57163-9_25 fatcat:wuacgcrb2veq5ablq4zy74he2a

Page 1662 of Mathematical Reviews Vol. , Issue 91C [page]

1991 Mathematical Reviews  
Next, a subclass of gcfg’s called multiple context-free grammars (mcfg’s) is introduced and it is shown that the class of languages generated by mcfg’s properly contains the class of context-free languages  ...  Furthermore, the class of lan- guages generated by mcfg’s enjoys the formal-language-theoretic closure properties that the class of context-free languages does.” 91¢:68074 68045 Petrich, Mario (3-WON);  ... 

Page 4080 of Mathematical Reviews Vol. , Issue 80J [page]

1980 Mathematical Reviews  
The (unrestricted) Dyck-language is D(a, b) and the author considers A = D(ab, ba). He shows some properties of A including that it is not context-free.  ...  The classes of recursively enumerable, context-sensitive and con- text-free languages are closed under the operation of “cyclic closure” [T. Oshiba, Electron. Commun.  ... 

Formal language theory and theoretical computer science [chapter]

Ronald V. Book
1975 Lecture Notes in Computer Science  
In this context I urge the reader to consult the paper "Programming languages, natural languages, and mathematics" by Peter Naur [ 2].  ...  In Part I of these notes I point to results of language theory which stem from or lend insight to the more general study of computability and computational complexity.  ...  Turing machines, the intersection closure of the class of context-free languages.  ... 
doi:10.1007/3-540-07407-4_1 fatcat:64fovopjqzgftlykgg3b3sixhy

Page 1579 of Mathematical Reviews Vol. , Issue 80D [page]

1980 Mathematical Reviews  
CGS with EOL schemes generate a class of languages conjectured to lie between the ETOL languages and context-free programmed languages.  ...  We study here w-context- free languages, which are the context-free languages containing finite and infinite words.” Paun, Gheorghe 80d :68094 Linear simple matrix languages.  ... 

Page 2817 of Mathematical Reviews Vol. , Issue 92e [page]

1992 Mathematical Reviews  
In the paper under review the following problem is studied: Is the above property satisfied for the class of w-context-free languages? The answer is negative.  ...  Then three sufficient conditions for the above class of w-languages to have w-context-free live sets are given.  ... 

Page 793 of Mathematical Reviews Vol. 49, Issue 2 [page]

1975 Mathematical Reviews  
The corresponding class of languages is a proper subclass of context-free languages in the former case, and of context-sensitive languages in the latter case.  ...  The class of languages acceptable by context-sensitive tree automata is considered and its closure properties are in- vestigated.  ... 

Page 3953 of Mathematical Reviews Vol. , Issue 92g [page]

1992 Mathematical Reviews  
We investigate the relations among the language classes generated by the grammars mentioned above, regular grammars, and linear context-free grammars.  ...  Patrice Séébold (Paris) 92g9:68083 68Q45 Okawa, Satoshi (J-HAIT); Hirose, Sadaki (J-TOYAU) Subclasses of linear context-free languages and homomorphic characterizations of languages. Systems Comput.  ... 

Page 1883 of Mathematical Reviews Vol. 55, Issue 6 [page]

1978 Mathematical Reviews  
Bertsch, E. 13876 Some considerations about classes of mappings between context- free derivation systems.  ...  These complex but powerful results have been used by the author and colleagues to establish many new results on one counter languages and linear languages and other context-free subfamilies.  ... 
« Previous Showing results 1 — 15 out of 149,835 results