Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

FCT
2001
Springer

favoriteEmaildiscussreport

104views Applied Computing» more FCT 2001»

Prediction-Preserving Reducibility with Membership Queries on Formal Languages

14 years 3 months ago

Prediction-Preserving Reducibility with Membership Queries on Formal Languages

Download www.dumbo.ai.kyutech.ac.jp

This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and ﬁnite 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 ﬁnite unions of regular pattern languages and unbounded ﬁnite unions of substring pattern languages are pwm-reducible to DFAs.

Kouichi Hirata, Hiroshi Sakamoto

Real-time Traffic

Applied Computing | FCT 2001 | Regular Pattern Languages | Unbounded ﬁnite Unions | ﬁnite Unions |

claim paper

Related Content

» Learning of EventRecording Automata

» A Characterization of the Language Classes Learnable with Correction Queries

» Randomised Language Modelling for Statistical Machine Translation

» Specifying Weak Sets

» Replacing Limit Learners with Equally Powerful OneShot Query Learners

» Learning Context Free Grammars with the Syntactic Concept Lattice

» OneShot Learners Using Negative Counterexamples and Nearest Positive Examples

» Techniques for efficiently querying scientific workflow provenance graphs

» Automated AssumeGuarantee Reasoning for Simulation Conformance

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	FCT
Authors	Kouichi Hirata, Hiroshi Sakamoto

Comments (0)