Abstract
To every algebra a = (A; K, 1, r, .) of signature (0, 1, 1, 2) the generalized Pascal triangle GPT(a) is associated. GPT(a) is constructed analogously as the classical Pascal triangle but the operation "·." on the set A is used instead of the addition on the set N of nonnegative integers. Moreover, the element K is put into the top of GPT(a), and the functions 1, r are used to construct the left and the right margin of GPT(a). Further, for every word w ∈ A+ the generalized Pascal triangle GPT(a, w) is associated. It is constructed similarly as GPT(a), we only use the word w in the initial line instead of K. The algebra a is said to be commutative if 1=r and the operation "·" is commutative. It is known that many algorithmic problems (concerning occurences of symbols in GPT(a) or GPT(a, w) etc.) are undecidable for the class of all finite algebras. It will be shown here that some of these problems remain unsolvable for the class of all finite commutative algebras.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
Culik, K., II.-Gruska, J.-Salomaa, A.: Systolic trellis automata. Intern. J. Computer Math., 1984, Vol. 16, 3–22.
Culik, K., II.-Gruska, J.-Salomaa, A.: Systolic trellis automata: Stability, decidability, and complexity. Research Report CS-82-04, Department of Computer Science, University of Waterloo, 1982.
Gruska, J.: Systolic automata — Power, characterizations, nonhomogeneity. Proceedings Mathematical Foundations of Computer Science, Praha, September 1984. Springer Verlag, Lecture Notes in Computer Science 176, 32–49.
Korec, I.: Generalized Pascal Triangles: Decidability Results. Acta Math.Univ.Comen. 46–47 (1985), 93–130.
Korec, I.: Generalized Pascal Triangles (in Slovak) Doctor Thesis, Comenius University, Bratislava, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korec, I. (1986). Undecidable problems concerning generalized pascal triangles of commutative algebras. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016271
Download citation
DOI: https://doi.org/10.1007/BFb0016271
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive