Abstract
An n-dimensional vector of natural numbers is said to be prime if the greatest common divisor of its components is one. A word is said to be Parikh prime if its Parikh vector is prime. The languages of Parikh prime and of Parikh non-prime words are investigated (they are neither semilinear nor slender, hence are not context-free or DOL languages; both of them can be generated by matrix grammars with appearance checking).
Marking in the plane the points identified by prime (2-dimensional) vectors, interesting patterns of non-marked (“free”) points appear (they are similar to the territories in the game of GO). The shape of such possible territories is investigated (with an exhaustive analysis of tro-, tetro-, pento- and hexominoes). Some open problems are formulated (both concerning the mentioned languages and the “GO territories theory”).
Research supported by the Academy of Finland, project 11281, and the ESPRIT Basic Research Working Group ASMICS II.
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
J. M. Autebert, J. Beauquier, L. Boasson, M. Nivat, Quelques problèmes ouverts en théorie des langages algébriques, RAIRO, Th. Informatics, 13, 4 (1979), 363–378.
E. R. Berlekamp, D. Wolfe, Mathematical GO: Chilling Gets the Last Point, Ishi Press, 1994.
E. R. Berlekamp, J. H. Conway, R. K. Guy, Winning Ways for Your Mathematical Plays, Academic Press, New York, 1982.
J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, Heidelberg, 1989.
J. Dassow, Gh. Păun, A. Salomaa, On thiness and slenderness of L languages, Bulletin of EATCS, 49 (1993), 152–158.
P. Dömösi, S. Horväth, M. Ito, L. Kászonyi, M. Katsura, Formal languages consisting of primitive words, FCT Conf 1993, Szeged (Z. Esik, ed.), LNCS 710, Springer-Verlag, 1993, 194–203.
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw- Hill Book Comp., New York, 1966.
R. K. Guy, Unsolved Problems in Number Theory, Springer-Verlag, New York, 1981.
M. Ito, M. Katsura, Context-free languages consisting of non-primitive words, Intern. J. Computer Math., 40 (1991), 157–167.
M. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983.
Gh. Păun, A. Salomaa, Thin and slender languages, Discrete Appi Math, 61 (1995), 257–270.
R. Ross, K. Winklmann, Repetitive strings are not context-free, Report CS- 81-070, Computer Sci. Dept., Washington Univ., 1981.
G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.
A. Salomaa, Formal Languages, Academic Press, New York, London, 1973.
A. Thue, Über unendliche Zeichenreihen, Norske Videns. Selsk. Skrifter Mat.-Nat. KL, Kristiania, 7 (1906), 1 –22.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Pub. Co.
About this chapter
Cite this chapter
Mateescu, A., Păun, G., Rozenberg, G., Salomaa, A. (1996). Parikh prime words and GO-like territories. In: Maurer, H., Calude, C., Salomaa, A. (eds) J.UCS The Journal of Universal Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80350-5_67
Download citation
DOI: https://doi.org/10.1007/978-3-642-80350-5_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-80352-9
Online ISBN: 978-3-642-80350-5
eBook Packages: Springer Book Archive