Abstract
Parallel communicating grammar systems with regular control (RPCGS, for short) are introduced, which are obtained from returning regular parallel communicating grammar systems by restricting the derivations that are executed in parallel by the various components through a regular control language. For the class of languages that are generated by RPCGSs with constant communication complexity we derive a characterization in terms of a restricted type of freely rewriting restarting automaton. From this characterization we obtain that these languages are semi-linear, and that centralized RPCGSs with constant communication complexity are of the same generative power as non-centralized RPCGSs with constant communication complexity.
This is a preview of subscription content, log in via an institution to check access.
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
Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Pǎun, G. (eds.): Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publishers (1994) ISBN 2-88124-957-4
Dassow, J., Pǎun, G.: Regulated Rewriting in Formal Language Theory. Springer, Heidelberg (1989)
Hromkovič, J., Kari, J., Kari, L., Pardubská, D.: Two lower bounds on distributive generation of languages. In: Privara, I., Ružička, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol. 841, pp. 423–432. Springer, Heidelberg (1994)
Kuboň, V., Lopatková, M., Plátek, M., Pognan, P.: A linguistically-based segmentation of complex sentences. In: Wilson, D., Sutcliffe, G. (eds.) 20th FLAIRS Conference, Proc., pp. 368–373. AAAI Press, Menlo Park (2007)
Lopatková, M., Plátek, M., Sgall, P.: Towards a formal model for functional generative description, analysis by reduction and restarting automata. The Prague Bulletin of Mathematical Linguistics 87, 7–26 (2007)
Otto, F.: Restarting automata. In: Ésik, Z., Martín-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Heidelberg (2006)
Otto, F., Plátek, M.: A two-dimensional taxonomy of proper languages of lexicalized FRR-automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 409–420. Springer, Heidelberg (2008)
Pardubská, D., Plátek, M.: Parallel communicating grammar systems and analysis by reduction by restarting automata. In: Bel-Enguix, G., Jimenez-Lopez, M.D. (eds.) International Workshop on Non-Classical Formal Languages in Linguistics, ForLing 2008, Proc., Tarragona, pp. 81–98 (2008)
Pardubská, D., Plátek, M., Otto, F.: On parallel communicating grammar systems and correctness preserving restarting automata. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 660–671. Springer, Heidelberg (2009)
Pardubská, D., Plátek, M., Otto, F.: On PCGS and FRR automata. In: Vojtáš, P. (ed.) Information Technologies – Applications and Theory, ITAT 2008, Proc., Department of Computer Science, Faculty of Science, Pavol Jozef Šafárik University, Košice,, pp. 41–47 (2008)
Pǎun, G.: On the synchronization in parallel communicating grammar systems. Acta Informatica 30, 351–367 (1993)
Pǎun, G., Santean, L.: Parallel communicating grammar systems: the regular case. Ann. Univ. Buc. Ser. Mat.-Inform. 37, 55–63 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pardubská, D., Plátek, M., Otto, F. (2009). Parallel Communicating Grammar Systems with Regular Control. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-03564-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03563-0
Online ISBN: 978-3-642-03564-7
eBook Packages: Computer ScienceComputer Science (R0)