umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Algorithmic properties of Millstream systems
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
2010 (English)In: Developments in Language Theory: 14th International Conference, DLT 2010 / [ed] Sheng Yu, Springer Berlin/Heidelberg, 2010, 54-65 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Series
Lecture notes in computer science, ISSN 0302-9743 ; 6224
National Category
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-33489DOI: 10.1007/978-3-642-14455-4_7ISI: 000286402700007ISBN: 978-3-642-14454-7 (print)ISBN: 978-3-642-14455-4 (print)OAI: oai:DiVA.org:umu-33489DiVA: diva2:313603
Conference
14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010
Available from: 2010-04-26 Created: 2010-04-26 Last updated: 2015-10-09Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Bensch, SunaBjörklund, HenrikDrewes, Frank
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 163 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf