Abstract
We establish an algebraic condition which is necessary and sufficient for a word function of finite rank to be expressible as the sum of two functions, each of rank lower than that of the given function.
Similar content being viewed by others
References
J. W. Carlyle, Stochastic finite-state systems theory, inSystem Theory, edited by L. A. Zadeh and E. Polak, New York, McGraw-Hill, 1969.
J. W. Carlyle andA. Paz, Realizations by stochastic finite automata,J. Comput. System Sci. 5 (1971), 26–40.
A. Heller, On stochastic processes derived from Markov chains,Ann. Math. Statist. 36 (1965), 1286–1291.
A. Heller, Probabilistic automata and stochastic transformations,Math. Systems Theory 1 (1967), 197–208.
D. B. Lahiri, Hypo-multiplicative number-theoretic functions,Aequationes Math. 9 (1973), 184–192.
A. Paz,Introduction to Probabilistic Automata, New York, Academic Press, 1971.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cobham, A. Representation of a word function as the sum of two functions. Math. Systems Theory 11, 373–377 (1977). https://doi.org/10.1007/BF01768487
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01768487