205 search results - page 24 / 41 » Testing the Equivalence of Regular Languages |
81
Voted
ICPR
2002
IEEE
16 years 26 days ago
2002
IEEE
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
204
click to vote
POPL
2004
ACM
16 years 2 days ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
116
Voted
CLEF
2008
Springer
15 years 1 months ago
2008
Springer
GeoCLEF is an evaluation initiative for testing queries with a geographic specification in large set of text documents. GeoCLEF ran a regular track for the third time within the C...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...
JALC
2007
14 years 11 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...