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

545views Artificial Intelligence» more LATA 2010»

The Inclusion Problem for Regular Expressions

14 years 10 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	545	The Inclusion Problem for Regular Expressions
2	229	Simplifying Regular Expressions. A Quantitative Perspective	claim
3	228	Avoidable Binary Patterns in Partial Words	claim
4	217	Extending Stochastic Context-Free Grammars for an Application in Bioinformatics	claim
5	216	A Randomized Numerical Aligner (rNA)	claim
6	210	Complexity of the Satisfiability Problem for a Class of Propositional Schemata	claim
7	207	Three Learnable Models for the Description of Language	claim
8	206	Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)	claim
9	206	Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data	claim
10	190	Untestable Properties Expressible with Four First-Order Quantifiers	claim
11	183	Operator Precedence and the Visibly Pushdown Property	claim
12	176	Variable Automata over Infinite Alphabets	claim
13	175	Abelian Square-Free Partial Words	claim
14	174	Pregroup Grammars with Letter Promotions	claim
15	174	Using Sums-of-Products for Non-standard Reasoning	claim
16	172	Choosing Word Occurrences for the Smallest Grammar Problem	claim
17	170	The Copying Power of Well-nested Multiple Context-free Grammars	claim
18	163	String Extension Learning Using Lattices	claim
19	163	Some Minimality Results on Biresidual and Biseparable Automata	claim
20	151	Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach	claim
21	143	Restarting Automata with Structured Output And Functional Generative Description	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers