759 search results - page 29 / 152 » Odometers on Regular Languages |
SEMWEB
2010
Springer
14 years 8 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
PPDP
2001
Springer
15 years 2 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
ICFP
2010
ACM
14 years 11 months ago
2010
ACM
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
ENGL
2007
14 years 10 months ago
2007
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
WCRE
2003
IEEE
15 years 3 months ago
2003
IEEE
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...