Weight Computation of Regular Tree Languages
Formal Languages and Automata Theory
2016-03-10 v1
Abstract
We present a general framework to define an application-dependent weight measure on terms that subsumes e.g. total simplification orderings, and an O(n log n) algorithm for the simultaneous computation of the minimal weight of a term in the language of each nonterminal of a regular tree grammar, based on Barzdins' liquid-flow technique.
Cite
@article{arxiv.1603.02928,
title = {Weight Computation of Regular Tree Languages},
author = {Jochen Burghardt},
journal= {arXiv preprint arXiv:1603.02928},
year = {2016}
}
Comments
26 pages; 3 figures. Originally published 23 Mar 2004 as "FIRST Reports 1/2004". Section 4 essentially describes Knuth's algorithm from his paper "A Generalization of Dijkstra's Algorithm" (Information Processing Letters, Vol.6, No.1, p.1-5, 1977); I wasn't aware of its existence at that time