Titlebook: Language and Automata Theory and Applications; 11th International C Frank Drewes,Carlos Martín-Vide,Bianca Truthe Conference proceedings 20

折磨

Postmenopause

增強(qiáng)

JOT

Consensus String Problem for Multiple Regular Languages the consensus string problem for . regular languages using additive weighted finite automata. We show that the consensus string problem for multiple regular languages becomes intractable when . is not fixed. We also examine the case when the length of the consensus string is given as part of input.

panorama

武器

Oratory

The Strong, Weak, and Very Weak Finite Context and Kernel Propertiesassumed to hold of the target language for the dual algorithm to succeed. We also show that the weak finite context property is genuinely weaker than Clark’s ., settling a question raised by Yoshinaka.

可商量

An Automata View to Goal-Directed Methodsement, and optimize. In this paper, we show that consequence-based reasoning can be reduced to the emptiness test of an appropriately built automaton. Thanks to this reduction, one can focus on developing efficient consequence-based algorithms, obtaining complexity bounds and other benefits of automata methods for free.

Dungeon

Pessary

On the Complexity of Hard Enumeration Problemsclasses analogous to the polynomial hierarchy and an appropriate notion of problem reduction are missing. In this work, we lay the foundations for a complexity theory of hard enumeration problems by proposing a hierarchy of complexity classes and by investigating notions of reductions for enumeration problems.