Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Representation and Identification Method of Finite State Automata by Recurrent High-Order Neural Networks

  • Conference paper
Artificial Neural Networks: Formal Models and Their Applications – ICANN 2005 (ICANN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3697))

Included in the following conference series:

Abstract

This paper presents a new architecture of neural networks for representing deterministic finite state automata. The proposed model is a class of high-order recurrent neural networks. It is capable of representing FSA with the network size being smaller than the existing models proposed so far. We also propose an identification method of FSA from a given set of input and output data by training the proposed model of neural networks.

An erratum to this chapter can be found at http://dx.doi.org/10.1007/11550907_163 .

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, New York (1967)

    MATH  Google Scholar 

  2. Alon, N., Dewdney, A.K., Ott, T.J.: Efficient Simulation of Automata by Neural Nets. Journal of Association for Computing Machinery 38(2), 495–514 (1991)

    MATH  MathSciNet  Google Scholar 

  3. Giles, C.L., Miller, C.B., Chen, D., Chen, H.H., Sun, G.Z., Lee, Y.C.: Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks. Neural Computation 4, 393–405 (1992)

    Article  Google Scholar 

  4. Zegn, Z., Goodman, R.M., Smyth, P.: Learning Finite State Machines with Self-Clustering Recurrent Networks. Neural Computation 5, 976–990 (1993)

    Article  Google Scholar 

  5. Giles, C.L., Chen, D., Sun, G., Chen, H., Lee, Y., Goudreau, W.: Constructive Learning of Recurrent Neural Networks: Limitations of Recurrent Casade Correlation and a Simple Solution. IEEE Trans. on Neural Networks 6(4), 829–836 (1995)

    Article  Google Scholar 

  6. Kuroe, Y.: Representation and Identification of Finite State Automata by Recurrent Neural Networks. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 261–268. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Kosmatopoulos, E.B., Polycarpou, M.M., Christodoulou, M.A., Ioannos, P.A.: High-Order Neural Network Structures for Identification of Dynamical Systems. IEEE Trans. Neural Networks 6(2), 422–431 (1995)

    Article  Google Scholar 

  8. Kuroe, Y., Ikeda, H., Mori, T.: Identification of Nonlinear Dynamical Systems by Recurrent High-Order Neural Networks. In: Proc. of IEEE International Conference on Systems, Man, and Cybernetics, vol. 1, pp. 70–75 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuroe, Y. (2005). Representation and Identification Method of Finite State Automata by Recurrent High-Order Neural Networks. In: Duch, W., Kacprzyk, J., Oja, E., Zadrożny, S. (eds) Artificial Neural Networks: Formal Models and Their Applications – ICANN 2005. ICANN 2005. Lecture Notes in Computer Science, vol 3697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550907_30

Download citation

  • DOI: https://doi.org/10.1007/11550907_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28755-1

  • Online ISBN: 978-3-540-28756-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics