Login / Signup
New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages.
Jorge Almeida
Ondrej Klíma
Published in:
Discret. Math. Theor. Comput. Sci. (2010)
Keyphrases
</>
upper bound
lower bound
higher level
lower level
expressive power
branch and bound algorithm
databases
worst case
first order logic
levels of abstraction
lower and upper bounds
relational databases
query language
branch and bound
text summarization
grammatical inference