The Dyck language D'-1-* is not generated by any matrix grammar of finite index
Information and Computation
Principles of artificial intelligence
Principles of artificial intelligence
On cooperating/distributed grammar systems
Journal of Information Processing and Cybernetics
Accepting multi-agent systems II
Acta Cybernetica - Special issue: selected papers of the workshop grammar systems: recent results and perspectives, Budapest, July 1996
On a hierarchy of languages generated by cooperating distributed grammar systems
Information Processing Letters
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
Theoretical Computer Science
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Bounded Parallelism in Array Grammars Used for Character Recognition
SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition
Character Recognition with k-Head Finite Array Automata
SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Accepting Array Grammars with Control Mechanisms
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Conditional Context-Free Languages of Finite Index
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On the expressive power of valences in cooperating distributed grammar systems
Computation, cooperation, and life
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Hi-index | 5.23 |
We continue our research on hybrid derivation modes of cooperating distributed (CD) grammar systems started in (Fernau et al., Proc. 3rd Internat. Conf. Developments in Language Theory, Aristotle University of Thessaloniki, 1997, pp. 261-272; Theoret. Comput. Sci. 259 (2001) 405). Here, we focus on (hybrid) systems with context-free components working in a hybrid t- and Δk-mode, Δ ∈ {≤, =}. We prove that CD grammar systems working in the mode (t v = 1), which means that each component cannot perform more than one derivation step in a row, characterize the context-free programmed languages with finite index. Moreover, we show that additional external hybridization of this mode with, e.g., the = 1-mode (or =2-mode, respectively) leads to a characterization of the context-free ordered languages (or the context-free programmed languages with appearance checking, respectively). In particular, hybrid CD grammar systems with classical and internally hybrid modes have universal computational power, a result which is unknown for hybrid CD grammar systems whose components work only in classical modes, since such systems are computationally equivalent to recurrent programmed grammars with appearance checking, as shown in (Theoret. Computer. Sci. 259 (2001) 405). Furthermore, we obtain a characterization of ordered languages within the framework of CD grammar systems.