Skip to main content
SpringerLink
Log in

Fuzzy Tree Grammar and Fuzzy Forest Grammar

  • Chapter
Advances in Fuzzy Sets, Possibility Theory, and Applications

  • 277 Accesses

Abstract

In 1956, Chomsky put forward a kind of mathematical model about grammar to approximately describe natural languages. Thus, formal language became one of the important research fields of computer science.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Brainerd, W. S. (1968), The Minimalization of Tree Automata, Inform. Control, 13, 484–491.

    Article  MathSciNet  MATH  Google Scholar 

  • Brainerd, W. S. (1969), Tree Generating Regular Systems, Inform. Control, 14, 217–231.

    Article  MathSciNet  MATH  Google Scholar 

  • Doner, J. E. (1970), Tree Acceptors and Some of Their Applications, J. Comput. System Sci. 4, 406–451.

    Article  MathSciNet  MATH  Google Scholar 

  • Fu, K. S., Huang, T. (1972), Stochastic Grammars and Languages, Int. J. Comput. and Inform. Sci. 1.

    Google Scholar 

  • Hoperoft, J. E., Ullman, J. D. (1969), Formal Languages and Their Relation to Automata, Addison-Wesley Publishing Company, Ch. 2, 10–32, Ch. 3, 34–60, Ch. 9., 157–175.

    Google Scholar 

  • Lee, E. T., Zadeh, L. A. (1969), Note on Fuzzy Languages, Inform. Sci. 1, 421–434.

    MathSciNet  Google Scholar 

  • Mizumoto, M., Toyoda, J., Tanaka, K. (1973), N-Fold Fuzzy Grammars, Inform. Sci., 5, 25–43.

    Article  MathSciNet  Google Scholar 

  • Negoita, C. V., Ralescu, D. A. (1975), Applications of Fuzzy Sets to Systems Analysis, Birkhaser Verlag, Basel und Stuttgart, Ch. 5, 135–142.

    Google Scholar 

  • Santos, E. S. (1974), Context-Free Fuzzy Languages, Inform. Control, 26, 1–11.

    Article  MATH  Google Scholar 

  • Takahashi, M. (1975), Generalizations of Regular Sets and Their Application to a Study of Context-Free Languages, Inform. Control, 27, 1–36.

    Article  MATH  Google Scholar 

  • Zadeh, L. A. (1965), Fuzzy Sets, Inform. Control, 8, 338–353.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shanghai Jiao Tong University, Shanghai, People’s Republic of China

    Shang-Yong Chu

Authors
  1. Shang-Yong Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Duke University, Durham, North Carolina, USA

    Paul P. Wang

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Plenum Press, New York

About this chapter

Cite this chapter

Chu, SY. (1983). Fuzzy Tree Grammar and Fuzzy Forest Grammar. In: Wang, P.P. (eds) Advances in Fuzzy Sets, Possibility Theory, and Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3754-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3754-6_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3756-0

  • Online ISBN: 978-1-4613-3754-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation