Consensus string problem for multiple regular languages

被引：1
|
作者：
Han, Yo-Sub [1 ]
Ko, Sang-Ki [2 ]
Ng, Timothy [3 ]
Salomaa, Kai [4 ]
机构：
[1] Yonsei Univ, Dept Comp Sci, Seoul, South Korea
[2] Kangwon Natl Univ, Dept Comp Sci & Engn, Chunchon, South Korea
[3] Univ Chicago, Dept Comp Sci, Chicago, IL 60637 USA
[4] Queens Univ, Sch Comp, Kingston, ON, Canada
来源：
INFORMATION AND COMPUTATION | 2021年 / 279卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
Consensus string problem; Computational complexity; Regular languages; Edit-distance; EDIT-DISTANCE; ALGORITHMS;
D O I：
10.1016/j.ic.2020.104615
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The consensus string (or centre string, closest string) of a set S of strings is defined as a string which is within a radius r from all strings in S. We study the consensus string problem for multiple languages recognized by finite automata (FAs). We define the consensus string of languages to be within distance at most r to some string in each of the languages. We also study the decidability and computational complexity of the consensus string problem for multiple formal language instances. We show that the consensus string problem for multiple regular languages is PSPACE-complete even when the radius r is fixed. We prove that the problem can be solved in polynomial time when the number of languages is fixed. Finally, we study that the consensus string problem for the class of input-driven languages and show that the problem is decidable. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页数：9
相关论文
共 50 条
  • [1] Consensus String Problem for Multiple Regular Languages
    Han, Yo-Sub
    Ko, Sang-Ki
    Ng, Timothy
    Salomaa, Kai
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2017), 2017, 10168 : 196 - 207
  • [2] TRACE LANGUAGES DEFINED BY REGULAR STRING LANGUAGES
    AALBERSBERG, IJ
    WELZL, E
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1986, 20 (02): : 113 - 119
  • [3] On the string consensus problem and the Manhattan sequence consensus problem
    Kociumaka, Tomasz
    Pachocki, Jakub W.
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    THEORETICAL COMPUTER SCIENCE, 2018, 710 : 126 - 138
  • [4] On the String Consensus Problem and the Manhattan Sequence Consensus Problem
    Kociumaka, Tomasz
    Pachocki, Jakub W.
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2014, 2014, 8799 : 244 - 255
  • [5] On the hardness of the Consensus String problem
    Amir, Amihood
    Paryenty, Haim
    Roditty, Liam
    INFORMATION PROCESSING LETTERS, 2013, 113 (10-11) : 371 - 374
  • [6] STRING AND GRAPH GRAMMAR CHARACTERIZATIONS OF BOUNDED REGULAR LANGUAGES
    SALOMON, KB
    INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1978, 7 (01): : 1 - 10
  • [7] THE EMPTINESS PROBLEM FOR INTERSECTIONS OF REGULAR LANGUAGES
    LANGE, KJ
    ROSSMANITH, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 629 : 346 - 354
  • [8] Configurations and Minority in the String Consensus Problem
    Amihood Amir
    Haim Paryenty
    Liam Roditty
    Algorithmica, 2016, 74 : 1267 - 1292
  • [9] Configurations and Minority in the String Consensus Problem
    Amir, Amihood
    Paryenty, Haim
    Roditty, Liam
    STRING PROCESSING AND INFORMATION RETRIEVAL: 19TH INTERNATIONAL SYMPOSIUM, SPIRE 2012, 2012, 7608 : 42 - 53
  • [10] Configurations and Minority in the String Consensus Problem
    Amir, Amihood
    Paryenty, Haim
    Roditty, Liam
    ALGORITHMICA, 2016, 74 (04) : 1267 - 1292
12345