Sciweavers

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

11

BIRTHDAY
1999
Springer

favoriteEmaildiscussreport

84views Applied Computing» more BIRTHDAY 1999»

Thompson Languages

13 years 9 months ago

Thompson Languages

Download cs.yonsei.ac.kr

We deﬁne simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outﬁx-free. We design algorithms that compute simple-regular languages from ﬁnite-state automata. Furthermore, we investigate the complexity blowup from a given ﬁnite-state automaton to its simple-regular language automaton and show that there is an exponential blowup. In addition, we present a ﬁnite-state automata construction for simple-regular expressions based on state expansion.

Dora Giammarresi, Jean-Luc Ponty, Derick Wood

Real-time Traffic

Applied Computing | BIRTHDAY 1999 | Simple-regular Expressions | Simple-regular Language | ﬁnite-state Automata |

claim paper

Related Content

» Initial Results with Structured Queries and Language Models on Half a Terabyte of Text

» Active Learning for Natural Language Parsing and Information Extraction

» Three BioNLP Tools Powered by a Biological Lexicon

» Extending a Natural Language Interface with Geospatial Queries

» Refactoring with wrangler updated data and process refactorings and integration with eclip...

» Refactoring Functional Programs

» A Language Modeling Approach to Predicting Reading Difficulty

» Declarative extensions of XML languages

» Combining Lexical and Grammatical Features to Improve Readability Measures for First and S...

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	BIRTHDAY
Authors	Dora Giammarresi, Jean-Luc Ponty, Derick Wood

Comments (0)