Grammars with context conditions and their applications. Accueil Grammars with context conditions and their applications. Partager Ajouter Me connecter M'inscrire. The essential guide to grammars with context conditions This advanced computer science book systematically and compactly summarizes the current knowledge about grammars with context conditions-an important area of formal language theory.
According to the types of context conditions, this self-contained reference classifies them into grammars with context conditions placed on the domains of grammatical derivations, the use of grammatical productions, and the neighborhood of the rewritten symbols. The focus is on grammatical generative power, important properties, simplification, reduction, implementation, and applications, most of which are related to microbiology.
Format Poche. Date de publication. Code Interne. Adobe DRM. Apart from binary operations, we also make some unary operations with languages. The i th power of L , L i , is defined as. Automata and Languages: Theory and Applications.
Springer , , pp. Rozenberg and A. Handbook of Formal Languages. Formal Languages.
Academic Press , , pp. If every derivation step in every successful derivation in G is leftmost, G generates L G in a leftmost way. If every step in every successful derivation in G is rightmost, G generates L G in a rightmost way. The family of languages generated by scattered context grammars is denoted by.
TOC | Context-sensitive Grammar (CSG) and Language (CSL)
The propagating scattered context language is a language generated by a propagating scattered context grammar. The family of languages generated by propagating scattered context grammars is denoted by. Greibach, J.
Scattered Context Grammars. Journal of Computer and System Sciences , , pp. On Scattered Context Grammars. Acta Universitatis Ouluensis , , pp.
Download Product Flyer
An abstract family of languages is a pair T, L , or L when T is understood, where. Theorem The family of propagating scattered context languages is an abstract family of languages. Theorem The family of propagating scattered context languages is not closed under arbitrary homomorphism and quotient by a regular language.
Theorem The emptiness problem is recursively unsolvable for propagating scattered context grammars. Gonczarowski, M. Scattered Versus Context-Sensitive Rewriting. Acta Informatica , , pp. Theorem The family of languages generated by extended propagating scattered context grammars coincides with the family of context-sensitive languages.
A stochastic context free grammar based framework for analysis of protein sequences
Masopust, J. The family of languages generated by propagating scattered context grammars which use leftmost or rightmost derivations is denoted by. Acta Cybernetica , , pp. Theoretical Computer Science , , pp. If G is a scattered context grammar, then its degree of context-sensitivity , symbolically written as dcs G , is defined as the number of context-sensitive productions in G. Open Problem Can every recursively enumerable language be described by a scattered context grammar containing only two nonterminals?
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars
Meduna, J. Furthermore, there is a bijection from P to lab G such that if this bijection maps a production A 1 , G is a proper generator of its sentences with their parses if and only if. Similarly, G is a proper generator of its sentences preceded by their parses if and only if. Notice that these definitions impose no restrictions on derivations in a proper leftmost generator. However, every proper leftmost generator G satisfies the property that if G makes a non-leftmost step during a derivation, then this derivation cannot generate a member of L G.
The same applies for proper rightmost generators. Proceedings of the Mathematical Foundations of Computer Science , , pp. Kleijn and G.