Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA.

Published in: RP (2010)

Keyphrases

finite state automata
construction process
cost effective
pairwise
data sets
machine learning
lightweight
computationally expensive
regular expressions
multiple representations