Skip to main content

On determining the k-Nerode equivalence for tree automata inference

  • Systems Theory And CAST
  • Conference paper
  • First Online:
Computer Aided Systems Theory — EUROCAST '89 (EUROCAST 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 410))

Included in the following conference series:

  • 120 Accesses

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.

References

  1. M.A. Arbib, ”Tree Automata and Learning the Base”, preprint.

    Google Scholar 

  2. A.W. Biermann, J.A. Feldman, ”On the Synthesis of Finite-State Machines from Samples of Their Behavior”, IEEE Trans. on Computers, vol. C-21, pp. 592–597, June 1972.

    Google Scholar 

  3. W.S. Brainerd ”Tree Generating Regular Systems”, Inf. and Contr. vol.14, pp. 217–231, 1969.

    Google Scholar 

  4. J.M. Brayer, K.S. Fu, ”A Note on k-Tail Method of Tree Grummar Inference”, IEEE Trans. on Syst., Man and Cybern., vol. SMC-7, pp. 293–300, April 1977.

    Google Scholar 

  5. F. Gecseg, M. Steinby, ”Tree Automata”, Akademiai Kiado, Budapest 1984.

    Google Scholar 

  6. R.C. Gonzales, J.J. Edwards, M.G. Thomson ”An Algorithm for the Inference of Tree Grammars”, Intern. J. of Comp. and Inform. Sciences, vol. 5, pp. 145–164, June 1976.

    Google Scholar 

  7. K.S. Fu, ”Syntactic Pattern Recognition and Applications”, Prentice Hall, Englewood Cliffs, New York 1982.

    Google Scholar 

  8. H. Fukuda, K. Kamata, ”Inference of Tree Automata from Sample Set of Trees', Int.J. of Comp. and Inform. Sciences, vol. 13, pp.177–196, June 1984.

    Google Scholar 

  9. B.Levine, ”Derivatives of Tree Sets with Application to Grammatical Inference”, IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-3, pp. 285–293, 1081.

    Google Scholar 

  10. B. Levine, ”The use of Tree Derivatives and a Sample Support Parameter for Inferring Tree Systems”, IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-4, pp.25–34, 1982.

    Google Scholar 

  11. F.Pichler,’ CAST-Computer Aided System Theory: A Framework For Interactive Method Bank”, in: R.Trappl (ed.), Cybernetics and Systems'88, Kluwer Academic Publishers, pp.731–736, 1988.

    Google Scholar 

  12. I. Sierocki, W. Jacak, ”Algebraic Characterization of Tree Automata Inference Problem”, IEEE Trans. on Syst., Man and Cybern., to appear.

    Google Scholar 

  13. I. Sierocki, W. Jacak, ”A Sequential Algorithm for the Synthesis of Tree Automata”, in: R.Trappl (ed.), Cybernetics and Systems'86, D.Reidel Publishing Company, pp. 685–691, 1986.

    Google Scholar 

  14. D. Angluin, C.H. Smith, ”Inductive Inference: Theory and Methods”, Computing Surveys, vol. 15, pp. 237–269, 1983.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

F. Pichler R. Moreno-Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sierocki, I. (1990). On determining the k-Nerode equivalence for tree automata inference. In: Pichler, F., Moreno-Diaz, R. (eds) Computer Aided Systems Theory — EUROCAST '89. EUROCAST 1989. Lecture Notes in Computer Science, vol 410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52215-8_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-52215-8_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52215-7

  • Online ISBN: 978-3-540-46932-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics