Languages Modulo Normalization

Authors:
Hitoshi Ohsaki;Hiroyuki Seki
Affiliations:
National Institute of Advanced Industrial Science and Technology,;Nara Institute of Science and Technology,
Venue:
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Year:
2007

Citing 18
Cited 1

Normalized rewriting: an alternative to rewriting modulo a set of equations

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
On Context-Free Languages

Journal of the ACM (JACM)
Typechecking for XML transformers

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Regular expression types for XML

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Decidability and Closure Properties of Equational Tree Languages

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Numerical document queries

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ground reducibility is EXPTIME-complete

Information and Computation
Reachability Analysis over Term Rewriting Systems

Journal of Automated Reasoning
XML schema, tree logic and sheaves automata

Applicable Algebra in Engineering, Communication and Computing
Multitree automata that count

Theoretical Computer Science - Foundations of software science and computation structures
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
Two-way equational tree automata for AC-like theories: decidability and closure properties

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Exact XML type checking in polynomial time

ICDT'07 Proceedings of the 11th international conference on Database Theory
A sufficient completeness checker for linear order-sorted specifications modulo axioms

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Propositional tree automata

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Combining Equational Tree Automata over AC and ACI Theories

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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) = xare closed under complement, which are notclosed 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.