LATA 2010 - PDF Preprint Papers

LATA 2010 Language and Automata Theory and Applications

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LATA-2010 Paper

click to vote

LATA
2010
Springer

361views Artificial Intelligence» more LATA 2010»

The Inclusion Problem for Regular Expressions

1 years 11 months ago

Download bora.uib.no

This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...

Dag Hovland

posted by daghovland

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	361	The Inclusion Problem for Regular Expressions
2	118	Simplifying Regular Expressions. A Quantitative Perspective	claim
3	95	Avoidable Binary Patterns in Partial Words	claim
4	91	Pregroup Grammars with Letter Promotions	claim
5	91	A Randomized Numerical Aligner (rNA)	claim
6	88	Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)	claim
7	87	Extending Stochastic Context-Free Grammars for an Application in Bioinformatics	claim
8	85	The Copying Power of Well-nested Multiple Context-free Grammars	claim
9	83	Using Sums-of-Products for Non-standard Reasoning	claim
10	82	Three Learnable Models for the Description of Language	claim
11	80	Untestable Properties Expressible with Four First-Order Quantifiers	claim
12	80	Variable Automata over Infinite Alphabets	claim
13	79	Choosing Word Occurrences for the Smallest Grammar Problem	claim
14	78	Operator Precedence and the Visibly Pushdown Property	claim
15	76	Complexity of the Satisfiability Problem for a Class of Propositional Schemata	claim
16	74	Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach	claim
17	74	Some Minimality Results on Biresidual and Biseparable Automata	claim
18	73	String Extension Learning Using Lattices	claim
19	69	Abelian Square-Free Partial Words	claim
20	60	Restarting Automata with Structured Output And Functional Generative Description	claim
21	55	Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers