Connecting Partial Words and Regular Languages

Dassow, Jürgen, Manea, Florin and Mercaş, Robert (2012) Connecting Partial Words and Regular Languages Lecture Notes in Computer Science, 7318 . pp. 151-161. DOI 10.1007/978-3-642-30870-3_16.

This is the latest version of this item.

[img]
Preview
Text
DasManMerCiEfinal.pdf - Accepted Version

Download (388Kb) | Preview

Supplementary data:

Abstract

We initiate a study of languages of partial words related to regular languages of full words. First, we study the possibility of expressing a regular language of full words as the image of a partial-words-language through a substitution that only replaces the hole symbols of the partial words with a finite set of letters. Results regarding the structure, uniqueness and succinctness of such a representation, as well as a series of related decidability and computational-hardness results, are presented. Finally, we define a hierarchy of classes of languages of partial words, by grouping together languages that can be connected in strong ways to regular languages, and derive their closure properties.

Document Type: Article
Keywords: Formal languages, Partial word, Regular language, Finite automaton, Language of partial words.
Research affiliation: ?? dep_sys ??
Refereed: Yes
DOI etc.: 10.1007/978-3-642-30870-3_16
ISSN: 0302-9743
Date Deposited: 16 Apr 2013 14:31
Last Modified: 16 Apr 2013 14:31
URI: http://eprints.uni-kiel.de/id/eprint/20752

Available Versions of this Item

  • Connecting Partial Words and Regular Languages (deposited 16 Apr 2013 14:31) [Currently Displayed]

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...