Skip to main content
SpringerLink
Log in

Rewriting regular inequalities

Extended abstract

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1995)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. M. Antimirov. Partial derivatives of regular expressions and finite automata constructions. In E. W. Mayr and C. Puech, editors, 12th Annual Symposium on Theoretical Aspects of Computer Science. Proceedings., volume 900 of Lecture Notes in Computer Science, pages 455–466. Springer-Verlag, 1995.

    Google Scholar 

  2. V. M. Antimirov and P. D. Mosses. Rewriting extended regular expressions. Theoretical Comput. Sci., 143:51–72, 1995.

    Google Scholar 

  3. J. A. Brzozowski. Derivatives of regular expressions. J. ACM, 11:481–494, 1964.

    Google Scholar 

  4. J. H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971.

    Google Scholar 

  5. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 6. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.

    Google Scholar 

  6. Z. Ésik and L. Bernátski. Equational properties of Kleene algebras of relations with conversion. Theoretical Comput. Sci., 137:237–251, 1995.

    Google Scholar 

  7. J. A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Comput. Sci., 105:217–273, 1992.

    Google Scholar 

  8. H. B. Hunt III, D. J. Rosenkrantz, and T. G. Szymanski. On the equivalence, containment, and covering problems for the regular and context-free languages. J. Comput. Syst. Sci., 12:222–268, 1976.

    Google Scholar 

  9. T. Jiang and B. Ravikumar. Minimal NFA problems are hard. SIAM J. Comput., 22(6):1117–1141, 1993.

    Google Scholar 

  10. A. R. Meyer and L. J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of the 13th Ann. IEEE Symp. on Switching and Automata Theory, pages 125–179. IEEE, 1972.

    Google Scholar 

  11. D. Perrin. Finite automata. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 1. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.

    Google Scholar 

  12. V. N. Redko. On defining relations for the algebra of regular events. Ukrainian Mat. Z., 16:120–126, 1964.

    Google Scholar 

  13. S. Yu, Q. Zhuang, and K. Salomaa. The state complexity of some basic operations on regular languages. Theoretical Comput. Sci., 125:315–328, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIN (CNRS) & INRIA-Lorraine, BP 239, F54506, Vandceuvre-lès-Nancy Cedex, France

    Valentin Antimirov

Authors
  1. Valentin Antimirov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antimirov, V. (1995). Rewriting regular inequalities. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation