The solution of two star height problems for regular trees


Regular trees can he detined by two types of rational exprwions. For these two types w;isolve the star-height problem, i.e., we show how to construct a rational expression of minimal star-height from the minimal graph of the given tree (i.e., the analogue of the minimal deterministic automaton for regular languages). In one case, the minimal starheight is… (More)
DOI: 10.1007/3-540-15641-0_28


5 Figures and Tables

Slides referencing similar topics