Skip to main content
SpringerLink
Log in

Algorithms for the inverse and a generalization of the state space approach to finite automata

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

The inverse of the state space approach to finite automata is developed. Both the obverse and converse aspects of the state space approach are extended to the general case in which the alphabet of a finite automaton consists of 2m symbols wherem is any positive integer. Relevant algorithms are designed and analyzed. State equations having or not having rational-function solutions are investigated and discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. T. Lee, A state space approach to the finite automata,Int. J. Comp. Inf. Sci.,12(5): 317–335 (1983).

    Google Scholar 

  2. S. Lang, Algebra, Addison-Wesley, Reading, (1965).

    Google Scholar 

  3. G. Bachman and L. Narici, Functional Analysis, Academic Press, New York, (1966).

    Google Scholar 

  4. G. Birkhoff and S. Maclane, A Survey of Modern Algebra, Macmillan, New York, (1941).

    Google Scholar 

  5. E. Horowitz and S. Sahni, Fundamentals of Data Structures, Computer Science Press, Potomac, (1976).

    Google Scholar 

  6. D. E. Knuth,Fundamental algorithms, in Vol. I/The Art of Computer Programming, Second Edition, Addison-Wesley, Reading, (1975).

    Google Scholar 

  7. A. Ginzburg, Algebraic Theory of Automata, Academic Press, New York, (1968).

    Google Scholar 

Download references

Author information

Author notes

  1. Houkuan Huang

    Present address: University of Florida, Gainesville, Florida

Authors and Affiliations

  1. Department of Computer and Information Sciences, University of Alabama in Birmingham, 35294, Birmingham, Alabama, USA

    Chao-Chih Yang & Houkuan Huang

  2. Harbin Shipbuilding Engineering Institute, Harbin, China

    Chao-Chih Yang & Houkuan Huang

Authors
  1. Chao-Chih Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Houkuan Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, CC., Huang, H. Algorithms for the inverse and a generalization of the state space approach to finite automata. International Journal of Computer and Information Sciences 13, 59–76 (1984). https://doi.org/10.1007/BF00989483

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00989483

Key words

Search

Navigation