10 search results - page 1 / 2 » Expressiveness modulo Bisimilarity of Regular Expressions wi... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
WIA
1999
Springer
1999
Springer
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
14 years 3 months ago
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
CONCUR
2006
Springer
14 years 24 days ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
SPIRE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
FROCOS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...