Abstract
In this paper we focus on characterizations of cooperating distributed grammar systems (henceforth CDGSs) working in { ≤ k, = k, ≥ k }-competence mode, k ≥ 1, defined in [1], by means of time, space and several other resources of a multicounter machine such as number of counters, reversals or 0-tests. We show that CDGSs working in { ≤ k, = k, ≥ k}-competence mode, k ≥ 1, can be simulated by one-way nondeterministic multicounter machines in linear time and space, with a linear-bounded number of reversals. If we impose restrictions on the capacity of each counter to perform 0-testings, we find that CDGSs working in { ≤ 1, = 1} ∪ { ≥ k | k ≥ 1}-competence mode can be simulated by one-way partially blind multicounter machines in quasirealtime. It is known from [8] that quasirealtime partially blind multicounter machines accept the family of Petri net languages. Consequently, various decision problems for partially blind multicounter machines are decidable. With respect to them, several decidability results, for CDGSs working in competence mode, grammars and systems with regulated rewriting, that emerge from the above simulations are presented, too.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ter Beek, M.H., et al.: On Competence in CD Grammar Systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 76–88. Springer, Heidelberg (2004)
Chan., T.: Reversal-Bounded Computations. PhD. Thesis, TR 80-448, Department of Computer Science, Cornell University, Ithaca, New York (December 1980)
Csuhaj-Varjú, E., et al.: Grammar Systems. A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, Amsterdam (1994)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Ďuriš, P., Hromkovič, J.: One-Way Simple Multihead Finite Automata are not Closed under Concatenation. Theoretical Computer Science 27, 121–125 (1983)
Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Counter Machines and Counter Languages. Mathematical System Theory 2, 265–283 (1968)
Greibach, S.A.: Remarks on the Complexity of Nondeterministic Counter Languages. Theoretical Computer Science 2, 269–288 (1976)
Greibach, S.A.: Remarks on Blind and Partially Blind One-Way Multicounter Machines. Theoretical Computer Science 7, 311–324 (1978)
Hack, M.: Petri Net Languages, Computation Structures. Group Memo 124. Project MAC, Massachusetts Institute of Technology (1975)
Hromkovič, J.: Hierarchy of Reversal Bounded One-Way Multicounter Machines. Kybernetika 22(2), 200–206 (1986)
Hromkovič, J.: Reversal-Bounded Nondeterministic Multicounter Machines and Complementation. Theoretical Computer Science 51, 325–330 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cojocaru, L. (2007). Characterizations of CD Grammar Systems Working in Competence Mode by Multicounter Machine Resources. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-70881-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70880-3
Online ISBN: 978-3-540-70881-0
eBook Packages: Computer ScienceComputer Science (R0)