Some Power-Decreasing Derivation Restrictions in Grammar Systems

  title={Some Power-Decreasing Derivation Restrictions in Grammar Systems},
  author={Alexander Meduna and Martin Cerm{\'a}k and Tomas Masopust},
  journal={Schedae Informaticae},
In this paper, we place some left restrictions on derivations in CD grammar systems with phrase-structure grammars, controlled by the regular languages. The first restriction requires that every production is always applied within the first k nonterminals in every sentential form, for some k ≥ 1. The second restriction says how many blocks of non-terminals can be in each sentential form. The third restriction extends the second restriction and says how many blocks of non-terminals with limited… 
3 Citations
Formal Systems Based upon Automata and Grammars
This work is based on my PhD thesis, which continues with studying of grammar and automata systems and defines two automata counterparts of canonical multi-generative nonterminal and rule synchronized grammar systems, generating vectors of strings, and shows that these investigated systems are equivalent.
Optimisation of Message Distribution in Ad-hoc networks
A new application-level communication protocol that is specialised on transferring large object structures, which uses UDP as an end-to-end datagram transportation service, because it is, according to the simulation results, more efficient than TCP.
Enhancing Web Surfing Experience in Conditions of Slow And Intermittent Internet Connection
OwNet is based on using a local proxy server, which acts as an intelligent bridge between the client’s browser application and the Internet and communicates with other clients and services in order to provide the best surfing experience.


On the Leftmost Derivation in Matrix Grammars
The main point of this paper is the systematic study of all possibilities of defining leftmost derivation in matrix grammars and finds a characterization of the recursively enumerable languages for matrix Grammars with the leftmost restriction defined on classes of a given partition of the nonterminal alphabet.
Regulated Rewriting in Formal Language Theory
This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies, as well as selective substitution grammars as one common generalization.
Two-Way Languages
Context-Limited Grammars
It is proved that context-limited Grammars are equivalent to context-free grammars, the equivalence including ambiguity, and a new formal model for ambiguity, based on directed plane graphs with labeled edges, is outlined and compared with other models.
Context-Free-Like Forms for the Phrase-Structure Grammars
Each phrase-structure grammar can be replaced by an equivalent grammar with all of the rules context-free, of the form S→v, where S is the initial symbol.
Automata and languages - theory and applications
This book discusses models for Context-Free Languages, properties of Regular Languages, and generalized models for Regular Languages.
Mappings which Preserve Context Sensitive Languages
Terminal Context in Context-Sensitive Grammars
  • R. V. Book
  • Computer Science, Linguistics
    SIAM J. Comput.
  • 1972
If every non-context-free rewriting rule of a context-sensitive (with erasing) grammar has as left context a string of terminal symbols and the left context is at least as long as the right context,
On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations
  • A. Meduna
  • Computer Science
    New Trends in Formal Languages
  • 1997
This investigation proves that four-nonterminal matrix grammars working in this way characterize the family of recursively enumerable languages.
External versus Internal Hybridization for Cooperating Distributed Grammar Systems
Several hybrid derivation modes of CD grammar systems are introduced and cases when internally hybrid systems are strictly more respectively less powerful than their externally hybrid counterparts are obtained.