Languages Modulo Normalization

  • Hitoshi Ohsaki
  • Hiroyuki Seki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4720)


We propose a new class of tree automata, called tree automata with normalization (TAN). This framework is obtained by extending equational tree automata, and improves the results of the previous work, such as: recognized tree languages modulo the idempotencyf(x,x) = x are closed under complement, which are not closed in equational tree automata, besides we do not lose important decidability. In the paper, first we investigate the closure properties of this class for Boolean operations and the decidability relative to the equational tree automata. Next we consider the relationship to other automata frameworks, in particular, hedge automata, which is a class of unranked tree automata. Hedge automata have been recognized in the XML database community as a theoretical basis for modeling the manipulation of semi-structured data. Through the observation about transformations from hedge automata to tree automata, we discuss advantages in the expressiveness and complexity of TAN. As an application of our framework, we show an example that XML schema with constraints that can not be dealt with by other tree automata frameworks is manipulated by TAN.


tree automata modulo axioms equational rewriting Boolean closedness decidability regularity hedge automata and XML schema 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Hitoshi Ohsaki
    • 1
  • Hiroyuki Seki
    • 2
  1. 1.National Institute of Advanced Industrial Science and Technology 
  2. 2.Nara Institute of Science and Technology 

Personalised recommendations