Skip to main content

Advertisement

Springer Nature Link
Log in

On the computation of quotients and factors of regular languages

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Quotients and factors are important notions in the design of various computational procedures for regular languages and for the analysis of their logical properties. We propose a new representation of regular languages, by linear systems of language equations, which is suitable for the following computations: language reversal, left quotients and factors, right quotients and factors, and factor matrices. We present algorithms for the computation of all these notions, and indicate an application of the factor matrix to the computation of solutions of a particular language reconstruction problem. The advantage of these algorithms is that they all operate only on linear systems of language equations, while the design of the same algorithms for other representations often require translation to other representations.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brzozowski J A. Derivatives of regular expressions. Journal of the Association for Computing Machinery, 1964, 11(4): 481–494

    MATH  MathSciNet  Google Scholar 

  2. Antimirov V M. Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science, 1996, 155: 291–319

    Article  MATH  MathSciNet  Google Scholar 

  3. Conway J H. Regular Algebra and Finite Machines. Mathematics series. Chapman and Hall, 1971

  4. Suzuki T, Okui S. Product derivatives of regular expressions. ISPJ Online Transactions, 2008, 1: 53–65

    Article  Google Scholar 

  5. Hopcroft J E, Ullman J D. Introduction to Automata Theory, Languages, and Computation. Series in Computer Science. Addison-Wesley Publishing Company, Inc., 1979

  6. Kozen D C. Automata and Computability. Undergraduate Texts in Computer Science. Springer-Verlag, New York, Inc., 1997

  7. Berstel J. Transductions and Context-Free Languages. B.G. Teubner Stuttgart, 1979

    MATH  Google Scholar 

  8. Mateescu A, Salomaa A, Yu S. On the decomposition of finite languages. In: Rozenberg G, Thomas W, eds. Developments in Language Theory: Foundations, Applications, Perspectives. World Scientific, 2000, 22–31

  9. Mateescu A, Salomaa A, Yu S. Factorizations of languages and commutativity conditions. Acta Cybernetica, 2002, 15(3): 339–351

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, 305-8573, Japan

    Mircea Marin

  2. Research Institute for Symbolic Computation, Johannes Kepler University, A-4040, Linz, Austria

    Temur Kutsia

Authors
  1. Mircea Marin
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Temur Kutsia
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Mircea Marin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marin, M., Kutsia, T. On the computation of quotients and factors of regular languages. Front. Comput. Sci. China 4, 173–184 (2010). https://doi.org/10.1007/s11704-010-0154-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-010-0154-8

Keywords