Prediction-Preserving Reducibility with Membership Queries on Formal Languages

This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular pattern languages. For the former, we mainly show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, we show that both bounded finite unions of regular pattern languages and unbounded finite unions of substring pattern languages are pwm-reducible to DFAs.

• Type: Conference
• Year: 2001
• Where: FCT
• Authors: Kouichi Hirata, Hiroshi Sakamoto
• Keywords: Applied Computing, FCT 2001, Regular Pattern Languages, Unbounded finite Unions, finite Unions