Login / Signup
Computing maximal Kleene closures that are embeddable in a given subword-closed language.
Stavros Konstantinidis
Nicolae Santean
Published in:
Nat. Comput. (2013)
Keyphrases
</>
closure operator
specification language
programming language
language learning
closed sets
propositional logic
regular expressions
closed world
object oriented programming
data sets
n gram
information retrieval
databases
language processing
computational linguistics
object oriented
natural language