Repetitiveness of D0L-Languages Is Decidable in Polynomial Time.

Yuji Kobayashi Friedrich Otto

Published in: MFCS (1997)

Keyphrases

polynomial hierarchy
expressive power
monadic second order logic
language independent
databases
first order logic
transitive closure
worst case
approximation algorithms
language identification
special case
data exchange
text summarization
function free horn
tree languages
target language
computational complexity