Solving Language Equations and Disequations Using Looping Tree Automata with Colors

Franz BaaderFranz Baader, Alexander OkhotinAlexander Okhotin

Download

Franz Baader, Alexander Okhotin
Solving Language Equations and Disequations Using Looping Tree Automata with Colors
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume 12-01, 2012. LTCS-Report

Details
Bibtex

KurzfassungAbstract
We extend previous results on the complexity of solving language equations with one-sided concatenation and all Boolean operations to the case where also disequations (i.e., negated equations) may occur. To show that solvability of systems of equations and disequations is still in ExpTime, we introduce a new type of automata working on infinite trees, which we call looping automata with colors. As applications of these results, we show new complexity results for disunification in the description logic FL0 and for monadic set constraints with negation. We believe that looping automata with colors may also turn out to be useful in other applications.
Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ BaOk-LTCS-12-01,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Alexander {Okhotin}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {12-01},
  title = {Solving Language Equations and Disequations Using Looping Tree Automata with Colors},
  type = {LTCS-Report},
  year = {2012},
}