Algorithmic properties of Millstream systems
2010 (English)In: Developments in Language Theory: 14th International Conference, DLT 2010 / [ed] Sheng Yu, Springer Berlin/Heidelberg, 2010, 54-65 p.Conference paper (Refereed)
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?
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2010. 54-65 p.
, Lecture notes in computer science, ISSN 0302-9743 ; 6224
IdentifiersURN: urn:nbn:se:umu:diva-33489DOI: 10.1007/978-3-642-14455-4_7ISI: 000286402700007ISBN: 978-3-642-14454-7ISBN: 978-3-642-14455-4OAI: oai:DiVA.org:umu-33489DiVA: diva2:313603
14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010