Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract).

Volker Diekert Steffen Kopecki

Published in: CIAA (2010)

Keyphrases

extended abstract
regular languages
decision problems
context free languages
regular expressions
grammatical inference
computational complexity
finite automata
worst case
databases
relational databases
semi supervised
utility function
positive data