@article{oai:nagoya.repo.nii.ac.jp:02001914, author = {Nishida, Naoki and Niwa, Minami}, journal = {Journal of Logical and Algebraic Methods in Programming}, month = {Aug}, note = {In this paper, we propose a determinization method of inverted grammar programs by means of context-free expressions (CFEs, for short) which are straightforward extensions (so-called μ-regular expressions) of regular expressions to context-free languages. Grammar programs are context-free grammars that an inversion method proposed by Glück and Kawabe uses as intermediate results. We use deterministic conditional term rewrite systems (DCTRSs, for short) as source and target programs, and our method aims at transforming a given DCTRS into a non-overlapping DCTRS that is computationally equivalent to the given one. To this end, we first translate a grammar program into an equivalent context-free expression. Then, by using some equalities of expressions, we transform the expression to a desired form. Finally, we translate the resulting expression back into an equivalent grammar program that can be translated back into a non-overlapping DCTRS.}, title = {Determinization of inverted grammar programs via context-free expressions}, volume = {122}, year = {2021} }