Regular hedge language factorization revisited

Authors:
Mircea Marin;Temur Kutsia
Affiliations:
Department of Computer Science, University of Tsukuba, Japan;RISC, Johannes Kepler University, Linz, Austria
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 6
Cited 0

Data on the Web: from relations to semistructured data and XML

Data on the Web: from relations to semistructured data and XML
Extended path expressions of XML

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XDuce: A statically typed XML processing language

ACM Transactions on Internet Technology (TOIT)
Regular expression pattern matching for XML

Journal of Functional Programming
Factorizations of Regular Hedge Languages

SYNASC '09 Proceedings of the 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Linear systems for regular hedge languages

ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the factorization problem of regular hedge languages. This problem is strongly related to the type checking problem in rule based transformations of valid XML documents. We propose the representation of regular hedge languages by reduced, complete, and deterministic linear hedge automata, and indicate algorithms for the computation of right factors and factor matrix.