Sciweavers

759 search results - page 56 / 152
» Overlap-Free Regular Languages
Sort
View
IS
2011
14 years 4 months ago
Checking determinism of XML Schema content models in optimal time
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
Pekka Kilpeläinen
DLT
1993
14 years 11 months ago
Rewriting Extended Regular Expressions
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
Valentin M. Antimirov, Peter D. Mosses
ICASSP
2009
IEEE
15 years 1 months ago
Neural network based language models for highly inflective languages
Speech recognition of inflectional and morphologically rich languages like Czech is currently quite a challenging task, because simple n-gram techniques are unable to capture impo...
Tomas Mikolov, Jirí Kopecký, Lukas B...
FSTTCS
2007
Springer
15 years 4 months ago
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg , a further variant where solutions are constrained ...
Pierre Chambart, Ph. Schnoebelen
FCT
2001
Springer
15 years 2 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...