3 citations · 8 across the 12 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2016★ 1 cited
Weight Computation of Regular Tree Languages
Jochen Burghardt
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 sim…
cs.FL2016
Repetition-Free Derivability from a Regular Grammar is NP-Hard
Jochen Burghardt
We prove the NP-hardness of the problem whether a given word can be derived from a given regular grammar without repeated occurrence of any nonterminal.
cs.FL2014
Regular Substitution Sets: A Means of Controlling E-Unification
Jochen Burghardt
A method for selecting solution constructors in narrowing is presented. The method is based on a sort discipline that describes regular sets of ground constructor terms as sorts. I…