Sciweavers

759 search results - page 38 / 152
» Overlap-Free Regular Languages
Sort
View
IPL
2007
105views more  IPL 2007»
13 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
SIGIR
2008
ACM
13 years 9 months ago
Improving relevance feedback in language modeling with score regularization
We demonstrate that regularization can improve feedback in a language modeling framework. Categories and Subject Descriptors: H.3.3 Information Search and Retrieval: Relevance Fee...
Fernando D. Diaz
ICALP
2000
Springer
14 years 1 months ago
Reasoning about Idealized ALGOL Using Regular Languages
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
Dan R. Ghica, Guy McCusker
DIAGRAMS
2008
Springer
13 years 11 months ago
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
Aidan Delaney, John Taylor, Simon J. Thompson
ESOP
2008
Springer
13 years 11 months ago
Regular Expression Subtyping for XML Query and Update Languages
Abstract. XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be...
James Cheney