206 search results - page 29 / 42 » Regular Expressions into Finite Automata |
COLING
2000
13 years 8 months ago
2000
Results presented in this paper strongly support the notion that similarities as well as differences in language systems can be empirically investigated by looking into the lingui...
ENTCS
2006
13 years 7 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
ENTCS
2002
13 years 7 months ago
2002
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
VIS
2007
IEEE
14 years 8 months ago
2007
IEEE
Modern unsteady (multi-)field visualizations require an effective reduction of the data to be displayed. From a huge amount of information the most informative parts have to be ext...
FOIKS
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...