Paper Info
Title
Translating XML Documents Through Dyck-Typed Regular Translation Elementary Formal Systems
Abstract
While a Dyck-typed regular translation elementary formal system (a Dyck-typed RTEFS, for short) can formulate the translations between XML documents, it cannot be learnable from positive examples if the number of clauses is unbounded and one of the operations as tag-renaming, tag-deleting and tag-adding, which we call tag-operating Dyck-typed RTEFSs, is allowed. In this paper, first we formulate the derivation procedure for Dyck-typed RTEFSs and provide the condition that it is complete. Next, we introduce determinate tag-operating Dyck-typed RTEFSs and show that they are learnable from positive examples even if the number of clauses is unbounded. Furthermore, we introduce k-composite TEFSs as a composition of k determinate tag-operating Dyck-typed RTEFSs, and show that they are also learnable from positive examples.
Year
DOI
Venue
2012
10.1109/IIAI-AAI.2012.52
Advanced Applied Informatics
Keywords
Field
DocType
elementary formal systems,elementary formal system,dyck-typed rtefss,positive example,derivation procedure,dyck-typed regular translation,dyck-typed rtefs,simple tag-operating dyck-typed rtefss,xml document,translating xml documents,translation,xml,formal language,informatics
Informatics,Formal system,Formal language,Programming language,XML,Computer science,Theoretical computer science,Regular language,Dyck language,Derivation procedure
Conference
ISBN
Citations 
PageRank 
978-1-4673-2719-0
1
0.40
References 
Authors
7
2
Name
Order
Citations
PageRank
Noriko Sugimoto1214.10
Kouichi Hirata213032.04