Summary
Finite automata are considered whose transition matrix is blockstochastic. The block-stochastic structure defines an equivalence relation among states of the automata. The implications of this relation are investigated, especially with respect to the languages accepted in the states of the automata.
Zusammenfassung
Es werden Endliche Automaten betrachtet, deren Übergangsmatrix block-stochastisch ist. Die block-stochastische Struktur definiert eine Äquivalenzbeziehung zwischen Zuständen des Automaten. Die Bedeutung und Auswirkung dieser Relation wird untersucht, und zwar insbesonders in Hinsicht auf die in den einzelnen Zuständen des Automaten angenommenen Sprachen.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Haynsworth, E. V.: Applications of a Theorem on Partitioned Matrices. —Journ. of Research of the National Bureau of Standards — B. Mathematics and Matheamtical Physics 62 B (1959), p. 73–78.
Walk, K.: Entropy and Testability of Context-Fre Languages. Paper presented at the IFIP Working Conference on Language Description Languages. Vienna (1964). IBM Techn. Report No. 25.5.008.
Chomsky, N., Miller, G. A.: Finite State Languages — Information and Control 1 (1957–1958), p. 91–112.
Wieland, H.: Unzerlegbare nicht negative Matrizen. — Math. Z. 52 (1950), p. 642–648.
Brauer, A.: Limits for the Characteristic Roots of a Matrix IV. — Duke Math. Journ. 19 (1952), p. 75.
Zürmuhl, R.: Matrizen und ihre technischen Anwendungen. — Springer-Verlag, Berlin-Göttingen-Heidelberg, (1961).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kuich, W., Walk, K. Block-stochastic matrices and associated finite-state languages. Computing 1, 50–61 (1966). https://doi.org/10.1007/BF02235852
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02235852