Advertisement

Mathematical systems theory

, Volume 11, Issue 1, pp 373–377 | Cite as

Representation of a word function as the sum of two functions

  • Alan Cobham
Article

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.

Keywords

Computational Mathematic Finite Rank Word Function Algebraic Condition 
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.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. W. Carlyle, Stochastic finite-state systems theory, inSystem Theory, edited by L. A. Zadeh and E. Polak, New York, McGraw-Hill, 1969.Google Scholar
  2. 2.
    J. W. Carlyle andA. Paz, Realizations by stochastic finite automata,J. Comput. System Sci. 5 (1971), 26–40.Google Scholar
  3. 3.
    A. Heller, On stochastic processes derived from Markov chains,Ann. Math. Statist. 36 (1965), 1286–1291.Google Scholar
  4. 4.
    A. Heller, Probabilistic automata and stochastic transformations,Math. Systems Theory 1 (1967), 197–208.Google Scholar
  5. 5.
    D. B. Lahiri, Hypo-multiplicative number-theoretic functions,Aequationes Math. 9 (1973), 184–192.Google Scholar
  6. 6.
    A. Paz,Introduction to Probabilistic Automata, New York, Academic Press, 1971.Google Scholar

Copyright information

© Springer-Verlag New York Inc 1978

Authors and Affiliations

  • Alan Cobham
    • 1
  1. 1.IBM Thomas J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations