Linear systems for regular hedge languages

Authors:
Mircea Marin;Temur Kutsia
Affiliations:
Department of Computer Science, University of Tsukuba, Japan;RISC, Johannes Kepler University, Linz, Austria
Venue:
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Year:
2009

Citing 5
Cited 1

Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Extended path expressions of XML

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automata and Computability

Automata and Computability
Regular expression types for XML

ACM Transactions on Programming Languages and Systems (TOPLAS)
Taxonomy of XML schema languages using formal language theory

ACM Transactions on Internet Technology (TOIT)

Regular hedge language factorization revisited

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose linear systems of hedge language equations as a formalism to represent regular hedge languages. This formalism is suitable for several algebraic computations, such as intersections, quotients, left and right factors of regular hedge languages. We indicate algorithms for the translation between hedge automata and linear systems of hedge language equations, and for the computations mentioned before.