Skip to main content
SpringerLink
Log in

On Minimization of Deterministic Automaton with Rough Output

  • Conference paper
  • First Online:
Theoretical Computer Science and Discrete Mathematics (ICTCSDM 2016)

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

Abstract

The purpose of the present work is to introduce and study the concept of minimal deterministic automaton with rough output which recognizes the given rough languages. Specifically, we use two concepts for such construction, one is based on Myhill-Nerode’s theory and the other is on the basis of derivatives of the given rough language. Lastly, we discuss monoid representations of the given rough languages.

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 EPUB and 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

References

  1. Basu, S.: Rough finite-state machine. Cybern. Syst. 36, 107–124 (2005)

    Article  MATH  Google Scholar 

  2. Borchardt, B.: The myhill-nerode theorem for recognizable tree series. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 146–158. Springer, Heidelberg (2003). doi:10.1007/3-540-45007-6_11

    Chapter  Google Scholar 

  3. Ignjatovi\(\acute{c}\), J., \(\acute{C}\)iric, M., Bogdanovi\(\acute{c}\), S., Petkovi\(\acute{c}\), T.: Myhill Nerode Type Theory for fuzzy languages and automata. Fuzzy Sets Syst. 161, 1288–1324 (2010)

    Google Scholar 

  4. Kierczak, J.: Rough grammars. Fund. Inform. VIII(1), 73–81 (1985)

    MATH  MathSciNet  Google Scholar 

  5. Kozen, D.: On the Myhill - Nerode theorem for trees. Bull. EATCS 47, 170–173 (1992)

    MATH  Google Scholar 

  6. Maletti, A.: Myhill-Nerode theorem for recognizable tree series revisited. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 106–120. Springer, Heidelberg (2008). doi:10.1007/978-3-540-78773-0_10

    Chapter  Google Scholar 

  7. Paun, G., Polkowski, L., Skowron, A.: Rough set approximations of languages. Fund. Inform. 32, 149–162 (1997)

    MATH  MathSciNet  Google Scholar 

  8. Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11, 341–356 (1982)

    Article  MATH  Google Scholar 

  9. Sharan, S., Srivastava, A.K., Tiwari, S.P.: Characterizations of rough finite-state automata. Int. J. Mach. Learn. Cybern. (2015). doi:10.1007/s13042-015-0372-3

  10. Tiwari, S.P., Sharan, S.: On coverings of rough transformation semigroups. In: Kuznetsov, S.O., Ślęzak, D., Hepting, D.H., Mirkin, B.G. (eds.) RSFDGrC 2011. LNCS (LNAI), vol. 6743, pp. 79–86. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21881-1_14

    Chapter  Google Scholar 

  11. Tiwari, S.P., Singh, A.K.: On minimal realization of fuzzy behaviour and associated categories. J. Appl. Math. Comput. 45, 223–234 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  12. Tiwari, S.P., Sharan, S.: Products of rough finite-state machines. J. Multiple-Valued Logic Soft Comput. 25(4–5), 339–356 (2015)

    MathSciNet  Google Scholar 

  13. Tiwari, S.P., Sharan, S., Singh, A.K.: On coverings of products of rough transformation semigroups. Int. J. Found. Comput. Sci. 24, 375–391 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  14. Tiwari, S.P., Yadav, V.K., Singh, A.K.: Constrution of a minimal realizatioin and monoid for a fuzzy languages: a categorical approach. J. Appl. Math. Comput. 47, 401–416 (2015)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Birla Institute of Technology, Ranchi, 834001, India

    B. K. Sharma

  2. Department of Mathematics, School of Advanced Sciences VIT University, Vellore, 632014, India

    S. Sharan

  3. Department of Applied Mathematics, Indian Institute of Technology (Indian School of Mines), Dhanbad, 826004, India

    S. P. Tiwari

Authors
  1. B. K. Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Sharan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. P. Tiwari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Sharan .

Editor information

Editors and Affiliations

  1. Kalasalingam University, Krishnankoil, India

    S. Arumugam

  2. Ball State University, Muncie, Indiana, USA

    Jay Bagga

  3. Indiana University – Purdue University, Fort Wayne, Indiana, USA

    Lowell W. Beineke

  4. Indian Institute of Technology, New Delhi, India

    B.S. Panda

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Sharma, B.K., Sharan, S., Tiwari, S.P. (2017). On Minimization of Deterministic Automaton with Rough Output. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science(), vol 10398. Springer, Cham. https://doi.org/10.1007/978-3-319-64419-6_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64419-6_49

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64418-9

  • Online ISBN: 978-3-319-64419-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation