6,306 Hits in 4.9 sec

On Müller Context-Free Grammars [chapter]

Zoltán Ésik, Szabolcs Iván
2010 Lecture Notes in Computer Science  
We define context-free grammars with Müller acceptance condition that generate languages of countable words.  ...  context-free grammars in normal form.  ...  context-free grammars in normal form.  ... 
doi:10.1007/978-3-642-14455-4_17 fatcat:cfxpidrsozdsddfgr5rtyzm3au

On Müller context-free grammars

Zoltán Ésik, Szabolcs Iván
2012 Theoretical Computer Science  
We define context-free grammars with Müller acceptance condition that generate languages of countable words.  ...  context-free grammars in normal form.  ...  context-free grammars in normal form.  ... 
doi:10.1016/j.tcs.2011.10.012 fatcat:i7i35vihzbgc5aydxleekzkkku

Probabilistic context-free grammars for phonology

Karin Müller
2002 Proceedings of the ACL-02 workshop on Morphological and phonological learning -  
Both grammars are evaluated qualitatively showing that probabilistic context-free grammars can contribute linguistic knowledge to phonology.  ...  We added rules for English phonemes to the grammar, and trained the enriched grammar on an English corpus.  ...  We train the context-free grammar for German on the transcribed and syllabified training corpus with a simple supervised training method (Müller, 2001a) .  ... 
doi:10.3115/1118647.1118655 dblp:conf/sigmorphon/Muller02 fatcat:yvl5vza2xbgc5dgjtykk4bvemu

MSO-definable Properties of Muller Context-Free Languages Are Decidable [chapter]

Zoltán Ésik, Szabolcs Iván
2016 Lecture Notes in Computer Science  
We show that it is decidable given an MSO-definable property P of countable words and a Muller context-free grammar G, whether every word in the language generated by G satisfies P .  ...  These grammars generate the Büchi and the Muller context-free languages of countable words, abbreviated as BCFLs and MCFLs.  ...  Actually, two types of grammars were defined, context-free grammars with Büchi acceptance condition (BCFG), and contextfree grammars with Muller acceptance condition (MCFG).  ... 
doi:10.1007/978-3-319-41114-9_7 fatcat:4dumxlmqing7zhdfn62rwzd52e

Subject index

1971 Information and Control  
GREIBACH, 65 Complexity and Unamblguity of Context- Free Grammars and Languages, J. GRUSKA, 502 Context-Free Languages, Cap Expres- sions for, M. K.  ...  YNTEMA, 311 Context-Free Languages, Structural Complexity of, K. KOBAYASHI, 299 Random Processes Statistics of Random Pulse Processes, On the, FREDERICK H. BEUTLER AND OSCAR A. Z.  ... 
doi:10.1016/s0019-9958(71)90537-7 fatcat:ieq73ozckbar3c5tuabjhdpkfq

Subject index

1969 Information and Control  
SCHNORR 252 Context-Free Grammar and Lan- guage, On the Index of a, A~To SALOMAA 474 Enumerable Grammars, A Note on, ANTONI W. MAZURKIEWICZ 555 Property Grammars and Table Ma- chines, R. E.  ...  in, PHILIP TWITCHELL SMITH 72 Languages, Context Free Context-Free Languages, Some Clas- sifications of, J.  ... 
doi:10.1016/s0019-9958(69)90378-7 fatcat:eqts3yd4rzbppol63wuzaqzx7a

Cumulative subject index volumes 30–32

1976 Information and Control  
grammars method for inference, 31, 129 Context-free languages structural similarity, 30, 267 Continuous functions on L~ spaces, approximation theorem, 30, 143 Controls context-free and context-sensitive  ...  applications of sociolinguistic restraints on 3-person conversations, 30, 234 context-free, method for inference, 31, 129 kolam array, context-free and context- sensitive controls, 32, 272 phrase  ... 
doi:10.1016/s0019-9958(76)90300-4 fatcat:6uhmar7mq5bq3emjcviioes64a

A Novel method to represent Access Tree structure by Context Free Grammar with and-or graph in Key Policy based Attribute based Encryption

K. Senthil Kumar, D. Malathi
2018 International Journal of Engineering & Technology  
In this paper we use a probabilistic context free grammar with an And-Or structure to represent access control structure.  ...  Definition: Context Free Grammar: As in Ullmann et al[18] a context free grammar is defined as follows A grammar G=(N,T,P,L) where N-A non empty set of non terminals T-A non empty set of terminals P-A  ...  Clearly the context free grammar represents various possible access policies.  ... 
doi:10.14419/ijet.v7i4.10.20946 fatcat:ggyzb3y2fbh4th7ht3hl2b3fhu

Page 7817 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
We prove that such systems with only two (A-free) context-free components can generate all recursively enumerable languages, and that systems with two regular com- ponents can generate non-context-free  ...  Unsynchronized context-free systems with separated alphabets have the same power as the correspond- ing usual systems.”  ... 

Regular Expressions for Muller Context-Free Languages

Kitti Gelle, Szabolcs Iván
2017 Acta Cybernetica  
Muller context-free languages (MCFLs) are languages of countable words, that is, labeled countable linear orders, generated by Muller context-free grammars.  ...  Equivalently, they are the frontier languages of (nondeterministic Muller-)regular languages of infinite trees.  ...  Actually, two types of grammars were defined, context-free grammars with Büchi acceptance condition (BCFG), and context-free grammars with Muller acceptance condition (MCFG).  ... 
doi:10.14232/actacyb.23.1.2017.19 fatcat:k4wsjn6dhzbfjhegehw6wegshm

Meeting the Boojum

Gregory M. Kobele
2014 Theoretical Linguistics  
HPSGà la Müller and Wechsler).  ...  Finally, Müller and Wechsler's conclusions trade on an equivocation between 'analyses which make certain distinctions between expressions' 1 I am making here an analogy to hill-climbing algorithms.  ...  Multiple Context-Free Grammars (MCFGs [20] , also LCFRSs [24] ) are a grammar formalism with desirable computational properties built around this kind of generalized wrapping operation.  ... 
doi:10.1515/tl-2014-0007 fatcat:nzae4pey6zh3reatqvye5zpit4

Subject index

1972 Information and Control  
KANNAPpAN, 38 G Grammars Compound and Serial Grammars, SAMUEL ABRAHAM, 432 Context-Free Grammars, Some Restrictive Devices for, O.  ...  COHEN, 93 / Languages Context-Free Languages, On permut- ing Letters of Words in, TaKESHI OSHIBA, 405 Equal Matrix Languages, Unambigous, RANI SIROMONEY, 1 Linear Systems Zeroing the Output of  ... 
doi:10.1016/s0019-9958(72)90920-5 fatcat:czrvcyozbjf53cdllbob2mpn4e

Model Checking and Higher-Order Recursion [chapter]

Hardi Hungar
1999 Lecture Notes in Computer Science  
The generation mechanism of macro graphs is of higher-order nature and relates to the context-free one like macro grammars [Fis68] relate to context-free grammars.  ...  Since Muller and Schupp have shown that monadic secondorder logic is decidable for context-free graphs in [MS85], several specialized procedures have been developed for related problems, mostly for sublogics  ...  Or one may take directly the set of context-free graphs with alternation-free formulas [BQ96], or guarded context-free processes with the full mu-calculus [Wal96,BS97].  ... 
doi:10.1007/3-540-48340-3_14 fatcat:go6uwsglj5esvlm2742n3szm7q

Subject index

1970 Information and Control  
GREIBACH, 7 Index of a Context-Free Language, A Note on the, NEIL D. JONES, 201 Languages Defined by Linear Prob- abilistie Automata, On, S.  ...  Konsr~, 123 Informational Model for Two-Person Games, An, SILVIU GUIASU, 103 Languages Entropy of Context-Free Languages, On the, WElShER KUICH, 173 Full AFLs and Nested Iterated Sub- stitution,  ... 
doi:10.1016/s0019-9958(70)90294-9 fatcat:k22phpc3jjfdhhvlnhlaxgpzmy

Büchi context-free languages

Zoltán Ésik, Szabolcs Iván
2011 Theoretical Computer Science  
We also define context-free grammars with Müller acceptance condition and show that there is a language generated by a grammar with Müller acceptance condition which is not a Büchi contextfree language  ...  We define context-free grammars with Büchi acceptance condition generating languages of countable words.  ...  Consider the Müller context-free grammar G = ({S, X }, {a}, P, S, {{X}})  ... 
doi:10.1016/j.tcs.2010.11.026 fatcat:6ruifzqwljd55fqyfznxxgx5rm
« Previous Showing results 1 — 15 out of 6,306 results