Skip to main content
SpringerLink
Log in

Regular Grammars and Languages

  • Chapter
Formal Languages and Applications

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 148))

  • 577 Accesses

Abstract

The notations used below are standard. In particular, if A ⊆ X* is a language, then the principal congruence P A of A is defined as follows: For any u, υ ∈ X*, u ≡ υ(P A ) if and only if (xuy ∈ A ↔ xvy ∈ A) for any x, y ∈ X*.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

  1. C. Câmpeanu, K. Salomaa, and S. Vâgvölgyi, Shuffle quotient and decompositions, Lecture Notes in Computer Science 2295, Springer, 2002, 186–196.

    Google Scholar 

  2. J.E. Hoperoft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading MA, 1979.

    Google Scholar 

  3. B. Imreh, M. Ito, and M. Katsura, On shuffle closures of commutative regular languages, Combinatorics, Complexity and Logic (edited by D.S. Bridges et al.), Springer, Singapore, 1996, 276–288.

    Google Scholar 

  4. M. Ito, Shuffle decomposition of regular languages, Journal of Universal Computer Science, 8 (2002), 257–259.

    Google Scholar 

  5. M. Ito and R. Sugiura, n-Insertion on languages, Aspects of Molecular Computing. Essays in Honour of Tom Head on the Occasion of his 70th Birthday (N. Jonoska, G. Pâun, G. Rozenberg, eds.) LNCS 2950, Springer, 2004, 212–217.

    Google Scholar 

  6. L. Kari, On Insertion and Deletion in Formal Languages, PhD thesis, University of Turku, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Sciences, Kyoto Sangyo University, Kyoto, 603-85555, Japan

    Masami Ito

Authors
  1. Masami Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Lingustics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  3. Institute of Mathematics, Romanian Academy, PO Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ito, M. (2004). Regular Grammars and Languages. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39886-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53554-3

  • Online ISBN: 978-3-540-39886-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation