context-free languages
A Chomsky Schützenberger Representation for Weighted Multiple Context free Languages
... Dyck languages using congruence relations to- gether with a decision algorithm for membership that is strongly related to these congruence relations ...multiple context-free languages ...
11
On the Preservation of Context Free Languages in a Level Based System
... ON THE PRESERVATION OF CONTEXT FREE LANGUAGES IN A LEVEL BASED SYSTEM ON THE PRESERVATION OF CONTEXT FREE LANGUAGES IN A LEVEL BASED SYSTEM Jacob Mey The University of Texas at Austin Austint Texas 78[.] ...
12
A formalisation of the theory of context-free languages in higher order logic
... be true for that particular framework. An incorrect framework doesn’t invalidate the proofs themselves: the proofs in such a case are just not useful to us. In mechanising the theory of context-free ...
177
Proofs of proximity for context free languages and read once branching programs
... specific languages. A notable class of languages for which we obtain such an improvement is the class of languages of balanced paren- theses expressions ...Dyck languages), which are ...
43
CFL/n denote the class of all context-free languages and its non-
... [2] Bar-Hillel, Y., M. Perles, and E. Shamir, “On formal properties of simple phrase structure grammars,” Zeitschrift f¨ur Phonetik, Sprach- wissenschaft und Kommunikationsforschung, 14 pp.143–172 (1961). [3] Berstel, J. ...
7
Polynomial Identification in the Limit of Substitutable Context-free Languages
... of context-free ...of languages to other common classes discussed in grammatical ...a context-free language—it is sufficient to identify the syntactic congruence, and the operations of ...
21
Using Contextual Representations to Efficiently Learn Context-Free Languages
... regular languages (An- gluin, 1987; Carrasco and Oncina, 1994), this class is not sufficient to correctly represent natural ...of languages to consider is the class of context-free ...
38
Intuitionistic Fuzzy Pushdown Automata and Intuitionistic Fuzzy Context-Free Languages
... Fuzzy Context Free Language with empty stack has an equivalent intuitionistic Fuzzy PDA that accepts the same language with final state and ...fuzzy context-free grammars (IFCFGs) and ...
11
Coalgebraic characterizations of context-free languages
... of context-free languages is not closed under inter- section, it is directly clear that adding this operator to the language of terms will yield a larger class of ...
39
An Intuitive Representation of Context Free Languages
... AN INTUITVE REPRESENTATION OF CONTEXT FREE LANGUAGES An i n t u i t i v e r e p r e s e n t a t i o n o f c o n t e x t f r e e l a n g u a g e s By L ~ s z l 6 KALM~ i n B z e g e d , H u n g a r y 1[.] ...
10
On the complexity of parallel parsing of general context free languages
... Abstract Let Tn be the time to recognize context-free languages on a parallel random access machine without write conflicts PRAM using a polynomial number of processors.. Let Pn be the t[r] ...
12
English and the Class of Context Free Languages
... It follows that the demonstration just presented holds not only for E1 and E2 but more generally for any variant of English whose matching condition for sluicing, even if different from [r] ...
5
A Formal Model for Context Free Languages Augmented with Reduplication
... We claim that our model captures most of the known constructions that make natural language provably not context-free as string sets, and that it does so with a small addition to the con[r] ...
12
Practical Experiments with Regular Approximation of Context Free Languages
... Table 2 Size of the compact representation and number of states and transitions, for the superset approximation based on LR automata following Pereira and Wright 1997... Grammar Size Com[r] ...
28
LFG Generation Produces Context free Languages
... a context-free ...other context-free based grammatical for- malisms, such as PATR, and also to formalisms that permit a context-free skeleton to be extracted (per- haps some ...
7
Algebraic Parsing of Context Free Languages
... A grammar is used to characterize a parsing homomorphism which maps terminal strings to a.. The image of a string under an.[r] ...
23
A Robust Class of Context Sensitive Languages
... word languages with a bounded num- ber of phases is of bounded tree-width (this is the prop- erty that allows us to embed them in ...non-regular languages. The non-regular but context-free ...
10
Optimal parallel parsing of bracket languages
... Abstract: We prove that the parsing problem for bracket context-free languages can be solved in logn time using n/logn processors on a parallel random access machine without write confli[r] ...
15
On the Mathematical Properties of Linguistic Theories
... APPE~IDIX Rounds [41] proves that context-sensitive rules under node-admissibility generate only context-free languages by constructing a non-deterministic bottom-up .tree automaton to r[r] ...
8
Well Nested Tree Languages and Attributed Tree Transducers
... mild context-sensitivity. Well-nested multiple context- free string grammars satisfy the additional condi- tion of a matching-like or well-nested rearrangement of the arguments of non-terminals on ...
10