Algorithmic properties of millstream systems

  • Authors:
  • Suna Bensch;Henrik Björklund;Frank Drewes

  • Affiliations:
  • Department of Computing Science, Umeå University, Umeå, Sweden;Department of Computing Science, Umeå University, Umeå, Sweden;Department of Computing Science, Umeå University, Umeå, Sweden

  • Venue:
  • DLT'10 Proceedings of the 14th international conference on Developments in language theory
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules related by interfaces. In this paper we investigate algorithmic properties of Millstream systems having regular tree grammars as modules and MSO logic as interface logic. We focus on the so-called completion problem: Given trees generated by a subset of the modules, can they be completed into a valid configuration of the Millstream system?