15,160 Hits in 5.1 sec

Page 4575 of Mathematical Reviews Vol. , Issue 98G [page]

1998 Mathematical Reviews  
Summary: “As in the string case, for n-dimensional array gram- mars we obtain regular, context-free, and monotonic grammars by imposing specific restrictions on the corresponding array produc- tions.  ...  Moreover, we show that it would be more efficient to apply the algorithm to a context-free grammar in canonical two form, obtaining a context-free grammar where, up to chain rules, the productions fulfill  ... 

Cooperating distributed context-free hexagonal array grammar systems with permitting contexts

Sujathakumari K, Dersanambika K.S
2014 International Journal of Mathematics Trends and Technology  
In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context free hexagonal array grammar systems as a control mechanism and investigating the  ...  arrays.  ...  In this paper we associate permitting symbols with rules of the grammar in the components of cooperating distributed context-free hexagonal array grammar systems as a control mechanism and investigating  ... 
doi:10.14445/22315373/ijmtt-v7p520 fatcat:j3e3o7hrqja7rplordbkypyn5i

Page 5888 of Mathematical Reviews Vol. , Issue 98I [page]

1998 Mathematical Reviews  
Summary: “We consider (n-dimensional) array grammars in the accepting mode with various control mechanisms and compare these families of array grammars with the corresponding families obtained by array  ...  with control mechanisms.  ... 

Pure 2D picture grammars and languages

K.G. Subramanian, Rosihan M. Ali, M. Geethalakshmi, Atulya K. Nagar
2009 Discrete Applied Mathematics  
An analogue of this 2D grammar model called pure 2D hexagonal context-free grammar (P2DHCFG) is also considered to generate hexagonal picture arrays on triangular grids.  ...  A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced based on the notion of pure context-free string grammar.  ...  A preliminary version of the paper was presented at the 12th International Workshop on Combinatorial Image Analysis, Buffalo, NY, USA, April 2008 [33] .  ... 
doi:10.1016/j.dam.2009.02.017 fatcat:7u4y3pn6djebhgf4stbciiweee

Bounded parallelism in array grammars used for character recognition [chapter]

Henning Fernau, Rudolf Freund
1996 Lecture Notes in Computer Science  
We present various non-context-free sets of arrays that can be generated in a simple way by cooperating distributed array grammar systems with prescribed teams working in different modes and show the power  ...  of the mechanism of cooperation for picture description and analysis as well as the efficiency of these models where several sets of productions work in parallel on the given sentential form.  ...  We are very grateful to Gheorghe P~.un and Markus Hotzer for many interesting and fruitful discussions on different variants of team grammar systems as well as on many specific topics of array grammars  ... 
doi:10.1007/3-540-61577-6_5 fatcat:ojixgl3etrap5jz7ck3a3ozgvm

Page 4269 of Mathematical Reviews Vol. , Issue 86i [page]

1986 Mathematical Reviews  
, are collections of context-free-like grammars with an additional mechanism deciding which grammar is active (only one can be active at a time).  ...  Zaks (Inform. and Control 55 (1982), no. 1-3, 108-116; MR 84m:68071] introduced and studied the notion of fair derivations in context- free grammars.  ... 

Contextual Array Grammars with Matrix and Regular Control [chapter]

Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian
2016 Lecture Notes in Computer Science  
Yet in the 1-dimensional case, for a one-letter alphabet, the family of 1-dimensional array languages generated by contextual array grammars with regular control languages coincides with the family of  ...  We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages.  ...  On the other hand, in the 1-dimensional case, the following theorem says that even with the regulating mechanisms of matrix control or regular control languages, with 1-dimensional contextual array grammars  ... 
doi:10.1007/978-3-319-41114-9_8 fatcat:2kyzz6kqrzb75pidwu6opbj43a

Page 726 of Mathematical Reviews Vol. , Issue 85b [page]

1985 Mathematical Reviews  
In this paper we introduce two other array analogues of context-free grammars. In one of them, blanks cannot serve as context.  ...  Cook and Wang introduced an array analogue of context-free grammars in order to complete a Chomsky hierarchy for array grammars and languages.  ... 

Character recognition with k-head finite array automata [chapter]

Henning Fernau, Rudolf Freund, Markus Holzer
1998 Lecture Notes in Computer Science  
We+ introduce the concept of k-head finite two-dimensional array automata and show how this model of two-dimensional array automata can be applied in the field of syntactic character recognition.  ...  Thus, tor an array grammar G = (I/N 3. context-free if it is #-context-free and monol,one.  ...  An array grammar is said to be of type MON, #-CF, or CF, respectively, if every array production in P is monotone, #-context-free, or context-free, respectively.  ... 
doi:10.1007/bfb0033246 fatcat:czsyavralnae3m3mpwbqjc2kdi

Page 5118 of Mathematical Reviews Vol. , Issue 83m [page]

1983 Mathematical Reviews  
sm:68137 COMPUTER SCIENCE (including AUTOMATA) S1is semi-context-free and context-free rules.  ...  An n-contextual grammar is a generative mechanism which extends to n the (2-)contextual grammars of S. Marcus.  ... 

Page 3201 of Mathematical Reviews Vol. , Issue 88f [page]

1988 Mathematical Reviews  
Summary: “We discuss here three classes of regulation mechanisms for context-free grammars, all three introduced in the eighties.  ...  A Kolam array gram- mar (KAG) is an array grammar with array rewriting rules [G. Siromoney, R. Siromoney and K. Krithivasan, Inform. and Control 22 (1973), 447-470; MR 49 #4327].  ... 

Page 6556 of Mathematical Reviews Vol. , Issue 2000i [page]

2000 Mathematical Reviews  
Several control mechanisms for string grammars as well as array grammars are introduced and the effect of (various versions of) the finite index restriction in regulated array grammars as well as in array  ...  A special k-head finite array automaton is introduced which char- acterizes the array languages generated by specific variants of regulated n-dimensional context-free array grammars of finite in- dex.  ... 

Alphabetic Flat Splicing Pure Context-free Grammar Systems

G. Samdanielthompson, N.Gnanamalar David, K. G. Subramanian
2017 Journal of Mathematics and Informatics  
on words and pure context-free rules.  ...  Here we introduce a grammar system, called alphabetic flat splicing pure context-free grammar system ‫,)ܵܩܨܥܲܵܨܣ(‬ as a new model of language generation, based on the operation of alphabetic flat splicing  ...  In the theory of formal grammars and languages, classes of grammars specified by different control mechanisms have been introduced to regulate rewriting and thereby increase the language generative capacity  ... 
doi:10.22457/jmi.v7a1 fatcat:bvwxxxu5xfasjbkejltz7hqg5m

HMM speech recognition using stochastic language models

Kenji Kita, Takeshi Kawabata, Toshiyuki Hanazawa
1991 Journal of the Acoustical Society of Japan (E)  
One of the major reasons for using language models in speech recognition is to reduce the search space. Context-free grammars or finite state grammars are suitable for this purpose.  ...  These models are 1) a trigram model of Japanese syllables, 2) a stochastic shift/reduce model in LR parsing, and 3) a trigram model of context-free rewriting rules.  ...  This mechanism is implemented as a trigram model of context-free rewriting rules.  ... 
doi:10.1250/ast.12.99 fatcat:o3jk4eueh5d4fm4il5osbuyktq

Multiset random context grammars, checkers, and transducers

Matteo Cavaliere, Rudolf Freund, Marion Oswald, Dragoş Sburlan
2007 Theoretical Computer Science  
We introduce a general model of random context multiset grammars as well as the concept of multiset random context checkers and transducers.  ...  On the other hand, for a #-context-free d-dimensional array production (W, A 1 , A 2 ) this does not hold true anymore, because its applicability depends on the occurrence of the whole array A 1 (Ω d )  ...  An array grammar (scheme) is said to be of type d-A R B A or d-#-C F A if every array production in P is of the corresponding type, i.e., an arbitrary or #-context-free d-dimensional array production,  ... 
doi:10.1016/j.tcs.2006.11.022 fatcat:sghcvgzywfcetamziuwxlsrhyq
« Previous Showing results 1 — 15 out of 15,160 results