Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"CONTEXT-FREE LANGUAGES"”.
-
Intercalation properties of context-free languages
<p>Context-freedom of a language implies certain intercalation properties known as pumping or iteration lemmas. Although the question of a converse result for some of the properties has been studied, it is still not entirely clear how these properties are related, which are the stronger ones and …
-
Weighted Logics and Weighted Simple Automata for Context-Free Languages of Infinite Words
… by Lautemann, Schwentick and Thérien to context-free languages by introducing a monadic second-order logic with an additional existentially quantified second-order variable. This new variable models the stack of pushdown au- tomata. A fundamental study by Cohen and Gold extended the …
-
A Generalized Regular Notation Used to Define Some Families of Context-Free Languages and to Obtain Their Closure Properties and Containment Relations
Made available in DSpace on 2014-12-09T22:17:27Z (GMT). No. of bitstreams: 1 6604326.pdf: 4043395 bytes, checksum: a8664ef5cc88c29c607491e35f5da0b3 (MD5) Previous issue date: 1965
-
Transformation of leftmost derivations in cooperating distributed grammar systems
… grammar systems allow the generation of non-context-free languages by having multiple context-free grammars derive terminal words in a concurrent way. New transformations of cooperating distributed grammar systems between various leftmost restrictions under the terminal mode of derivation are …
-
Gramáticas e linguagens indiciais probabilísticas
A new type of grammar for generating formal languages, called indexed gramar, was presented by Alfred V. Aho, in Austin, Texas, 1967. The languages generated by indexed grammars are called indexed languages. The class of languages generated by indexed grammars properly includes a11 context free …
-
Exploring Computational Models: Analysis, Extensions, and Novel Approaches in Automata Theory
… and the ability to recognize certain non-context-free languages, while also identifying limitations of the model. Finally, it situates CBFA within the broader computational hierarchy and outlines future research directions, including extensions toward counter-based pushdown automata.
-
On labeled paths
… result presents an empirical analysis of two context-free labeled all-pairs shortest-path algorithms using MapReduce as the experimental platform. The second and third results examine labeled paths in the context of formal languages beyond the context-free languages. The second result is a …
-
A Lightweight Framework for Universal Fragment Composition
Domain-specific languages (DSLs) are useful tools for coping with complexity in software development. DSLs provide developers with appropriate constructs for specifying and solving the problems they are faced with. While the exact definition of DSLs can vary, they can roughly be divided into two …
-
SCAN: ΜΙΑ ΓΛΩΣΣΑ ΓΙΑ ΑΚΟΛΟΥΘΙΑΚΗ ΠΡΟΣΠΕΛΑΣΗ ΔΙΔΙΑΣΤΑΤΩΝ ΔΕΔΟΜΕΝΩΝ
… IS (N2)! DIFFERENT SEQUENCES)". SCAN IS A SIMPLE CONTEXT-FREE LANGUAGE DEVOTED TO DESCRIBE AND GENERATE A WIDE RANGE OF TWO DIMENTIONAL ARRAY ACCESSING ALGORITHMS FROM A SHORT SET OF SIMPLE AND FUNDAMENTAL ONES, WHICH ARE DEFINED AS ELEMENTS OF THE SCAN ALPHABET. THE ALGORITHMS GENERATED BYSCAN …