Decidability and Closure Properties of Equational Tree Languages

  • Hitoshi Ohsaki
  • Toshinori Takai
Conference paper

DOI: 10.1007/3-540-45610-4_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2378)
Cite this paper as:
Ohsaki H., Takai T. (2002) Decidability and Closure Properties of Equational Tree Languages. In: Tison S. (eds) Rewriting Techniques and Applications. RTA 2002. Lecture Notes in Computer Science, vol 2378. Springer, Berlin, Heidelberg

Abstract

Equational tree automata provide a powerful tree language framework that facilitates to recognize congruence closures of tree languages. In the paper we show the emptiness problem for AC-tree automata and the intersection-emptiness problem for regular AC-tree automata, each of which was open in our previous work [20], are decidable, by a straightforward reduction to the reachability problem for ground AC-term rewriting. The newly obtained results generalize decidability of so-called reachable property problem of Mayr and Rusinowitch [17]. We then discuss complexity issue of AC-tree automata. Moreover, in order to solve some other questions about regular A- and AC-tree automata, we recall the basic connection between word languages and tree languages.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hitoshi Ohsaki
    • 1
  • Toshinori Takai
    • 1
  1. 1.National Institute of Advanced Industrial Science and TechnologyAmagasakiJapan

Personalised recommendations