Skip to main content
SpringerLink
Log in

Linear Systems for Regular Hedge Languages

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5968))

Abstract

We propose linear systems of hedge language equations as a formalism to represent regular hedge languages. This formalism is suitable for several algebraic computations, such as intersections, quotients, left and right factors of regular hedge languages. We indicate algorithms for the translation between hedge automata and linear systems of hedge language equations, and for the computations mentioned before.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science 155, 291–319 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Conway, J.H.: Regular Algebra and Finite Machines. Mathematics series. Chapman and Hall, Boca Raton (1971)

    MATH  Google Scholar 

  3. Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. ACM Transactions on Programming Languages and Systems 27(1), 46–90 (2005)

    Article  Google Scholar 

  4. Kozen, D.C.: Automata and Computability. Undergraduate Texts in Computer Science. Springer, New York (1997)

    MATH  Google Scholar 

  5. Marin, M., Kutsia, T.: Computational methods in an algebra of regular hedge expressions. RISC Report Series 09-03, RISC-Linz (March 2009)

    Google Scholar 

  6. Murata, M.: Hedge automata: a formal model for XML schemata (1999), http://www.xml.gr.jp/relax/hedge_nice.html

  7. Murata, M.: Extended path expressions for XML. In: Proceedings of the 20th symposium on Principles of Database Systems (PODS 2001), Santa Barbara, California, USA, pp. 126–137. ACM, New York (2001)

    Google Scholar 

  8. Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory. ACM Transactions on Internet Technology 5(4), 660–704 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Tsukuba, Japan

    Mircea Marin

  2. RISC, Johannes Kepler University, Linz, Austria

    Temur Kutsia

Authors
  1. Mircea Marin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Temur Kutsia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Systems Theory and Design, Riga Technical University, Meza str 1/4, LV 1048, Riga, Latvia

    Janis Grundspenkis

  2. Institute of Applied Computer Systems, Riga Technical University, 1 Kalku, LV-1658, Riga, Latvia

    Marite Kirikova

  3. Dept. of Informatics, Aristotle University, 54124, Thessaloniki, Greece

    Yannis Manolopoulos

  4. Division of Applied Computer Systems Software, Riga Technical University, Meza str 1/4, LV 1048, Riga, Latvia

    Leonids Novickis

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marin, M., Kutsia, T. (2010). Linear Systems for Regular Hedge Languages. In: Grundspenkis, J., Kirikova, M., Manolopoulos, Y., Novickis, L. (eds) Advances in Databases and Information Systems. ADBIS 2009. Lecture Notes in Computer Science, vol 5968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12082-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12082-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12081-7

  • Online ISBN: 978-3-642-12082-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation