Algorithmic Properties of Millstream Systems

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?

• Type: Conference
• Year: 2010
• Where: DLT
• Authors: Suna Bensch, Henrik Björklund, Frank Drewes
• Keywords: DLT 2010, Millstream System, Regular Tree Grammars, So-called Completion Problem, Theoretical Computer Science