Skip to main content
Springer Nature Link
Log in

On a generalization of regular expression

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

CF expressions are defined. Using the concept of D-graphs, it is demonstrated that CF expressions define CF languages. A subclass (equivalent to the class of regular expressions) of pseudo-coiterating CF expressions is defined.

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Gruska, J., A Characterization of Context-Free Languages,J. Comput. Syst. Sci., 1971, vol. 5, pp. 353–364.

    MATH  MathSciNet  Google Scholar 

  2. McWhirter, I.P., Substitution Expressions,J. Comput. Syst. Sci., 1971, vol. 5, pp. 629–637.

    MATH  MathSciNet  Google Scholar 

  3. Stanevichene, L.I., Some Definitions of the Class of CF Languages,Programmirovanie, 1999, vol. 25, no. 5, pp. 15–25.

    MathSciNet  Google Scholar 

  4. Lallement, G.,Semigroups and Combinatorial Applications, New York: Wiley, 1979. Translated under the titlePolugruppy i kombinatornye prilozheniya, Moscow: Mir, 1985.

    MATH  Google Scholar 

  5. Stanevichene, L.I., The Core of a CF Grammar and Syntax Analysis,Programmirovanie, 1996, vol. 22, no. 5, pp. 18–29.

    MathSciNet  Google Scholar 

  6. Vylitok, A.A., Stanevichene, L.I., and Cherntsov, I.V.,D.-grafy v teorii magazinnykh avtomatov (D-Graphys in the Theory of Push-Down Automato), Available from VINITI, 1996, Moscow, no. 3730-B96.

Download references

Author information

Authors and Affiliations

  1. Department of Computational Mathematics and Cybernetics, Moscow State University, Vorob’evy gory, 117234, Moscow, Russia

    A. L. Gomozov & L. I. Stanevichene

Authors
  1. A. L. Gomozov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. I. Stanevichene
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gomozov, A.L., Stanevichene, L.I. On a generalization of regular expression. Program Comput Soft 26, 258–267 (2000). https://doi.org/10.1007/BF02759319

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02759319

Keywords