[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Document Open Access Logo

A Robust Class of Languages of 2-Nested Words

Authors Séverine Fratani, Guillaume Maurras, Pierre-Alain Reynier

PDF
Thumbnail PDF

File

LIPIcs.MFCS.2022.50.pdf
  • Filesize: 0.69 MB
  • 15 pages

Document Identifiers

Author Details

Séverine Fratani
  • LIS, Aix-Marseille Univ, CNRS, Marseille, France
Guillaume Maurras
  • LIS, Aix-Marseille Univ, CNRS, Marseille, France
Pierre-Alain Reynier
  • LIS, Aix-Marseille Univ, CNRS, Marseille, France

Funding

Partly supported by the DeLTA ANR project (ANR-16-CE40-0007)

Cite As Get BibTex

Séverine Fratani, Guillaume Maurras, and Pierre-Alain Reynier. A Robust Class of Languages of 2-Nested Words. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 50:1-50:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.MFCS.2022.50

Abstract

Regular nested word languages (a.k.a. visibly pushdown languages) strictly extend regular word languages, while preserving their main closure and decidability properties. Previous works have shown that considering languages of 2-nested words, i.e. words enriched with two matchings (a.k.a. 2-visibly pushdown languages), is not as successful: the corresponding model of automata is not closed under determinization. In this work, inspired by homomorphic representations of indexed languages, we identify a subclass of 2-nested words, which we call 2-wave words. This class strictly extends the class of nested words, while preserving its main properties. More precisely, we prove closure under determinization of the corresponding automaton model, we provide a logical characterization of the recognized languages, and show that the corresponding graphs have bounded treewidth. As a consequence, we derive important closure and decidability properties. Last, we show that the word projections of the languages we define belong to the class of linear indexed languages.

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
  • Theory of computation → Formal languages and automata theory
Keywords
  • Nested word
  • Determinization
  • Indexed languages

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Alfred V. Aho. Indexed grammars - an extension of context-free grammars. J. ACM, 15(4):647-671, 1968. URL: https://doi.org/10.1145/321479.321488.
  2. Rajeev Alur and P. Madhusudan. Visibly pushdown languages. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pages 202-211. ACM, 2004. URL: https://doi.org/10.1145/1007352.1007390.
  3. Rajeev Alur and P. Madhusudan. Adding nesting structure to words. J. ACM, 56(3):16:1-16:43, 2009. URL: https://doi.org/10.1145/1516512.1516518.
  4. Benedikt Bollig. On the expressive power of 2-stack visibly pushdown automata. Log. Methods Comput. Sci., 4(4), 2008. URL: https://doi.org/10.2168/LMCS-4(4:16)2008.
  5. Dario Carotenuto, Aniello Murano, and Adriano Peron. 2-visibly pushdown automata. In Tero Harju, Juhani Karhumäki, and Arto Lepistö, editors, Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings, volume 4588 of Lecture Notes in Computer Science, pages 132-144. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-73208-2_15.
  6. Dario Carotenuto, Aniello Murano, and Adriano Peron. Ordered multi-stack visibly pushdown automata. Theor. Comput. Sci., 656:1-26, 2016. URL: https://doi.org/10.1016/j.tcs.2016.08.012.
  7. Bruno Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In Grzegorz Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, pages 313-400. World Scientific, 1997. Google Scholar
  8. W. Damm. The IO- and OI-hierarchies. Theoret. Comput. Sci., 20(2):95-207, 1982. Google Scholar
  9. J. Engelfriet. Iterated pushdown automata and complexity classes. In Proceedings of the 14th Symposium on Theory of Computing, pages 365-373. Association for Computing Machinery, 1983. Google Scholar
  10. Séverine Fratani and El Makki Voundy. Epsilon-reducible context-free languages and characterizations of indexed languages. Inf. Comput., 269, 2019. URL: https://doi.org/10.1016/j.ic.2019.104444.
  11. Robert H. Gilman. A shrinking lemma for indexed languages. Theor. Comput. Sci., 163(1&2):277-281, 1996. URL: https://doi.org/10.1016/0304-3975(96)00244-7.
  12. Clemens Lautemann, Thomas Schwentick, and Denis Thérien. Logics for context-free languages. In Leszek Pacholski and Jerzy Tiuryn, editors, Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers, volume 933 of Lecture Notes in Computer Science, pages 205-216. Springer, 1994. URL: https://doi.org/10.1007/BFb0022257.
  13. P. Madhusudan and Gennaro Parlato. The tree width of auxiliary storage. In Thomas Ball and Mooly Sagiv, editors, Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011, pages 283-294. ACM, 2011. URL: https://doi.org/10.1145/1926385.1926419.
  14. A. N. Maslov. The hierarchy of index languages of arbitrary level. Dokl. Akad. Nauk SSSR, 217:1013-1016, 1974. Google Scholar
  15. A. N. Maslov. Multilevel pushdown automata. Problemy Peredači Informacii, 12(1):55-62, 1976. Google Scholar
  16. A. Okhotin. Non-erasing variants of the chomsky-schützenberger theorem. In Developments in Language Theory, volume 7410 of Lecture Notes in Comput. Sci., pages 121-129. Springer, 2012. Google Scholar
  17. Detlef Seese. The structure of models of decidable monadic theories of graphs. Ann. Pure Appl. Log., 53(2):169-195, 1991. URL: https://doi.org/10.1016/0168-0072(91)90054-P.
  18. Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. On multiple context-free grammars. Theor. Comput. Sci., 88(2):191-229, 1991. URL: https://doi.org/10.1016/0304-3975(91)90374-B.
  19. Salvatore La Torre, Parthasarathy Madhusudan, and Gennaro Parlato. A robust class of context-sensitive languages. In 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pages 161-170. IEEE Computer Society, 2007. URL: https://doi.org/10.1109/LICS.2007.9.
  20. Salvatore La Torre, Parthasarathy Madhusudan, and Gennaro Parlato. The language theory of bounded context-switching. In Alejandro López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, volume 6034 of Lecture Notes in Computer Science, pages 96-107. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-12200-2_10.
  21. Salvatore La Torre, Margherita Napoli, and Gennaro Parlato. Scope-bounded pushdown languages. Int. J. Found. Comput. Sci., 27(2):215-234, 2016. URL: https://doi.org/10.1142/S0129054116400074.
  22. D. Weir. Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania, 1988. Available as Technical Report MS-CIS-88-74. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact