Skip to main content
Springer Nature Link
Log in

Rewrite Closure and CF Hedge Automata

  • Conference paper
Language and Automata Theory and Applications (LATA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7810))

  • 1084 Accesses

Abstract

We introduce an extension of hedge automata called bidimensional context-free hedge automata. The class of unranked ordered tree languages they recognize is shown to be preserved by rewrite closure with inverse-monadic rules. We also extend the parameterized rewriting rules used for modeling the W3C XQuery Update Facility in previous works, by the possibility to insert a new parent node above a given node. We show that the rewrite closure of hedge automata languages with these extended rewriting systems are context-free hedge languages.

This work has been partly supported by the grant ANR-12-CORD-0009 ”Inedit”.

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

Access this chapter

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

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular Model Checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403–418. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Bouajjani, A., Touili, T.: On Computing Reachability Sets of Process Rewrite Systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 484–499. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Bravo, L., Cheney, J., Fundulaki, I.: ACCOn: checking consistency of XML write-access control policies. In: Proc. 11th Int. Conf. on Extending Database Technology (EDBT). ACM Int. Conf. Proc. Series, vol. 261, pp. 715–719. ACM (2008)

    Google Scholar 

  4. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://tata.gforge.inria.fr/ (release October 12, 2007)

  5. Coquide, J.L., Dauchet, M., Gilleron, R., Vagvolgyi, S.: Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Theoretical Computer Science 127, 69–98 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability Analysis over Term Rewriting Systems. Journal of Automated Reasoning 33(3-4), 341–383 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fundulaki, I., Maneth, S.: Formalizing XML access control for update operations. In: Proc. of the 12th ACM Symposium on Access Control Models and Technologies (SACMAT), pp. 169–174. ACM (2007)

    Google Scholar 

  8. Jacquemard, F., Rusinowitch, M.: Closure of Hedge-Automata Languages by Hedge Rewriting. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 157–171. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Jacquemard, F., Rusinowitch, M.: Rewrite-based verification of XML updates. In: Proc. of the 12th ACM SIGPLAN Int. Symp. on Principles and Practice of Declarative Programming (PPDP), pp. 119–130. ACM (2010)

    Google Scholar 

  10. Jacquemard, F., Rusinowitch, M.: Rewrite Closure and CF Hedge Automata (2012), http://hal.inria.fr/hal-00752496 (long version)

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

  12. Ohsaki, H., Seki, H., Takai, T.: Recognizing Boolean Closed a-Tree Languages with Membership Conditional Rewriting Mechanism. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 483–498. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Salomaa, K.: Deterministic tree pushdown automata and monadic tree rewriting systems. J. Comput. Syst. Sci. 37(3), 367–394 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  14. Solimando, A., Delzanno, G., Guerrini, G.: Automata-based Static analysis of XML Document Adaptation. In: Proceedings 3d International Symposium on Games, Automata, Logics and Formal Verification, vol. 96, pp. 85–98 (2012)

    Google Scholar 

  15. Touili, T.: Computing transitive closures of hedge transformations. In: Proc. 1st International Workshop on Verification and Evaluation of Computer and Communication Systems (VECOS). eWIC Series. British Computer Society (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Nancy–Grand Est & LORIA UMR, 615 rue du Jardin Botanique, 54602, Villers-les-Nancy, France

    Michael Rusinowitch

  2. INRIA Paris–Rocquencourt & Ircam UMR, 1 place Igor Stravinsky, 75004, Paris, France

    Florent Jacquemard

Authors
  1. Florent Jacquemard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Rusinowitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jacquemard, F., Rusinowitch, M. (2013). Rewrite Closure and CF Hedge Automata. In: Dediu, AH., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2013. Lecture Notes in Computer Science, vol 7810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37064-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37064-9_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37063-2

  • Online ISBN: 978-3-642-37064-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics