Search: id:"swepub:oai:DiVA.org:umu-41284" >
Recognizing shuffle...
Recognizing shuffled languages
-
- Berglund, Martin (author)
- Umeå universitet,Institutionen för datavetenskap,Naturliga och Formella Språk
-
- Björklund, Henrik (author)
- Umeå universitet,Institutionen för datavetenskap
-
- Högberg, Johanna, 1978- (author)
- Umeå universitet,Institutionen för datavetenskap,Formal and Natural Languages
-
(creator_code:org_t)
- Berlin, Heidelberg : Springer Berlin/Heidelberg, 2011
- 2011
- English.
-
Series: Report / UMINF, 0348-0542 ; 11.01
-
In: Language and Automata Theory and Applications. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642212536 ; , s. 142-154
- Related links:
-
https://urn.kb.se/re...
-
show more...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
show less...
Abstract
Subject headings
Close
- Language models that use interleaving, or shuffle, operators have applications in various areas of computer science, including system verification, plan recognition, and natural language processing. We study the complexity of the membership problem for such models, i.e., how difficult it is to determine if a string belongs to a language or not. In particular, we investigate how interleaving can be introduced into models that capture the context-free languages.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Keyword
- interleaving
- shuffle languages
- membership problems
Publication and Content Type
- ref (subject category)
- kon (subject category)
Find in a library
To the university's database