Skip to main content
SpringerLink
Log in

Generalized Register Context-Free Grammars

  • Conference paper
  • First Online:
Book cover Language and Automata Theory and Applications (LATA 2019)

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

Abstract

Register context-free grammars (RCFG) is an extension of context-free grammars to handle data values in a restricted way. This paper first introduces register type as a finite representation of the register contents and shows some properties of RCFG. Next, generalized RCFG (GRCFG) is defined by permitting an arbitrary relation on data values in the guard expression of a production rule. We extend register type to GRCFG and introduce two properties of GRCFG, the simulation property and the type oracle. We then show that \(\varepsilon \)-rule removal is possible and the emptiness and membership problems are EXPTIME solvable for GRCFG that satisfy these two properties.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Notes

  1. 1.

    We exclude the diagonal elements \(\{(i,i)\mid i\in [k]\}\) from the domain of a register type because the applicability of a rule does not depend on whether \(\theta (i)\bowtie \theta (i)\).

  2. 2.

    For readability, we denote a register type as a Boolean formula on a register assignment \(\theta \). For example, \(\gamma _2(1,2)=\mathtt{tt}\) and \(\gamma _2(2,1)=\mathtt{ff}\) if we follow the notation defined in Sect. 4.2.

References

  1. Benedikt, M., Ley, C., Puppis, G.: What you must remember when processing data words. In: 4th Alberto Mendelzon International Workshop on Foundations of Data Management (2010)

    Google Scholar 

  2. Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. J. ACM 56(3), 13:1–13:48 (2009). https://doi.org/10.1145/1516512.1516515

    Article  MathSciNet  MATH  Google Scholar 

  3. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27:1–27:26 (2011). https://doi.org/10.1145/1970398.1970403

    Article  MathSciNet  MATH  Google Scholar 

  4. Bojańczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3) (2014). https://doi.org/10.2168/LMCS-10(3:4)2014

  5. Bouyer, P.: A logical characterization of data languages. Inf. Process. Lett. 84(2), 75–85 (2002). https://doi.org/10.1016/S0020-0190(02)00229-6

    Article  MathSciNet  MATH  Google Scholar 

  6. Cheng, E.Y., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf. 35(3), 245–267 (1998). https://doi.org/10.1007/s002360050120

    Article  MathSciNet  MATH  Google Scholar 

  7. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), 16:1–16:30 (2009). https://doi.org/10.1145/1507244.1507246

    Article  MathSciNet  MATH  Google Scholar 

  8. Demri, S., Lazić, R., Nowak, D.: On the freeze quantifier in constraint LTL: decidability and complexity. Inf. Comput. 205(1), 2–24 (2007). https://doi.org/10.1016/j.ic.2006.08.003

    Article  MathSciNet  MATH  Google Scholar 

  9. Figueira, D., Hofman, P., Lasota, S.: Relating timed and register automata. Math. Struct. Comput. Sci. 26(6), 993–1021 (2016). https://doi.org/10.1017/S0960129514000322

    Article  MathSciNet  MATH  Google Scholar 

  10. Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329–363 (1994). https://doi.org/10.1016/0304-3975(94)90242-9

    Article  MathSciNet  MATH  Google Scholar 

  11. Libkin, L., Martens, W., Vrgoč, D.: Querying graphs with data. J. ACM 63(2), 14:1–14:53 (2016). https://doi.org/10.1145/2850413

    Article  MathSciNet  MATH  Google Scholar 

  12. Libkin, L., Tan, T., Vrgoč, D.: Regular expressions for data words. J. Comput. Syst. Sci. 81(7), 1278–1297 (2015). https://doi.org/10.1016/j.jcss.2015.03.005

    Article  MathSciNet  MATH  Google Scholar 

  13. Libkin, L., Vrgoč, D.: Regular path queries on graphs with data. In: 15th International Conference on Database Theory (ICDT 2012), pp. 74–85 (2012). https://doi.org/10.1145/2274576.2274585

  14. Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. In: 19th ACM Symposium on Principles of Database Systems (PODS 2000), pp. 11–22 (2000). https://doi.org/10.1145/335168.335171

  15. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3), 403–435 (2004). https://doi.org/10.1145/1013560.1013562

    Article  MathSciNet  MATH  Google Scholar 

  16. Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2), 297–308 (2000). https://doi.org/10.1016/S0304-3975(99)00105-X

    Article  MathSciNet  MATH  Google Scholar 

  17. Senda, R., Takata, Y., Seki, H.: Complexity results on register context-free grammars and register tree automata. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 415–434. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-02508-3_22

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nagoya University, Furo-cho, Chikusa, Nagoya, 464-8601, Japan

    Ryoma Senda & Hiroyuki Seki

  2. Graduate School of Engineering, Kochi University of Technology, Tosayamada, Kami City, Kochi, 782-8502, Japan

    Yoshiaki Takata

Authors
  1. Ryoma Senda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshiaki Takata
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroyuki Seki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ryoma Senda .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  2. Saint Petersburg State University, St. Petersburg, Russia

    Alexander Okhotin

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Senda, R., Takata, Y., Seki, H. (2019). Generalized Register Context-Free Grammars. In: Martín-Vide, C., Okhotin, A., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2019. Lecture Notes in Computer Science(), vol 11417. Springer, Cham. https://doi.org/10.1007/978-3-030-13435-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-13435-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-13434-1

  • Online ISBN: 978-3-030-13435-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation