Acta Informatica最新文献

{"title":"From regular expression matching to parsing","authors":"Philip Bille,&nbsp;Inge Li Gørtz","doi":"10.1007/s00236-022-00420-6","DOIUrl":"10.1007/s00236-022-00420-6","url":null,"abstract":"<div><p>Given a regular expression <i>R</i> and a string <i>Q</i>, the regular expression parsing problem is to determine if <i>Q</i> matches <i>R</i> and if so, determine how it matches, i.e., by a mapping of the characters of <i>Q</i> to the characters in <i>R</i>. Regular expression parsing makes finding matches of a regular expression even more useful by allowing us to directly extract subpatterns of the match, e.g., for extracting IP-addresses from internet traffic analysis or extracting subparts of genomes from genetic data bases. We present a new general techniques for efficiently converting a large class of algorithms that determine if a string <i>Q</i> matches regular expression <i>R</i> into algorithms that can construct a corresponding mapping. As a consequence, we obtain the first efficient linear space solutions for regular expression parsing.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 6","pages":"709 - 724"},"PeriodicalIF":0.6,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44390261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"(mathcal {L})-reduction computation revisited","authors":"Kaoru Fujioka,&nbsp;Fumiya Okubo,&nbsp;Takashi Yokomori","doi":"10.1007/s00236-022-00418-0","DOIUrl":"10.1007/s00236-022-00418-0","url":null,"abstract":"<div><p>Let <i>K</i> and <i>L</i> be two languages over <span>(Sigma )</span> and <span>(Gamma )</span> (with <span>(Gamma subset Sigma )</span>), respectively. Then, the <i>L</i>-reduction of <i>K</i>, denoted by <span>(K%,L)</span>, is defined by <span>({ u_0u_1cdots u_n in (Sigma - Gamma )^* mid u_0v_1u_1 cdots v_nu_n in K, v_i in L (1le i le n) })</span>. This is extended to language classes as follows: <span>({mathcal {K}}% {mathcal {L}}={K%L mid K in {mathcal {K}}, , L in {mathcal {L}} })</span>. In this paper, we investigate the computing powers of <span>(mathcal {K}%,mathcal {L})</span> in which <span>(mathcal {K})</span> ranges among various classes of <span>(mathcal {INS}^i_{!!j})</span> and min-<span>(mathcal {LIN})</span>, while <span>(mathcal {L})</span> is taken as <span>(mathcal {DYCK})</span> and <span>(mathcal {F})</span>, where <span>(mathcal {INS}^i_{!!j})</span>: the class of insertion languages of weight (<i>j</i>, <i>i</i>), min-<span>(mathcal {LIN})</span>: the class of minimal linear languages, <span>(mathcal {DYCK})</span>: the class of Dyck languages, and <span>(mathcal {F})</span>: the class of finite languages. The obtained results include:</p><ul>\u0000 <li>\u0000 <p><span>(mathcal {INS}^1_1,%,mathcal {DYCK}=mathcal {RE})</span></p>\u0000 </li>\u0000 <li>\u0000 <p><span>(mathcal {INS}^0_i,%,mathcal {F}= mathcal {INS}^1_j,%,mathcal {F}=mathcal {CF})</span> (for <span>(ige 3)</span> and <span>(jge 1)</span>)</p>\u0000 </li>\u0000 <li>\u0000 <p><span>(mathcal {INS}^0_2,%,mathcal {DYCK}=mathcal {INS}^0_2)</span></p>\u0000 </li>\u0000 <li>\u0000 <p>min-<span>(mathcal {LIN},%,mathcal {F}_1=mathcal {LIN})</span></p>\u0000 </li>\u0000 </ul><p> where <span>(mathcal {RE})</span>, <span>(mathcal {CF})</span>, <span>(mathcal {LIN})</span>, <span>(mathcal {F}_1)</span> are classes of recursively enumerable, of context-free, of linear languages, and of singleton languages over unary alphabet, respectively. Further, we provide a very simple alternative proof for the known result min-<span>(mathcal {LIN},%,mathcal {DYCK}_2=mathcal {RE})</span>. We also show that with a certain condition, for the class of context-sensitive languages <span>(mathcal {CS})</span>, there exists no <span>(mathcal {K})</span> such that <span>(mathcal {K}%,mathcal {DYCK}=mathcal {CS})</span>, which is in marked contrast to the characterization results mentioned above for other classes in Chomsky hierarchy. It should be remarked from the viewpoint of molecular computing theory that the notion of <i>L</i>-reduction is naturally motivated by a molecular biological functioning well-known as RNA splicing occurring in most eukaryotic genes.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"409 - 426"},"PeriodicalIF":0.6,"publicationDate":"2022-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50102392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Ldocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$mathcal {L}$$end{document}-reduction computation revisited","authors":"Kaoru Fujioka, Fumiya Okubo, T. Yokomori","doi":"10.1007/s00236-022-00418-0","DOIUrl":"https://doi.org/10.1007/s00236-022-00418-0","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 1","pages":"409 - 426"},"PeriodicalIF":0.6,"publicationDate":"2022-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46875681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Minimum status of trees with a given degree sequence","authors":"Haiyan Guo,&nbsp;Bo Zhou","doi":"10.1007/s00236-022-00416-2","DOIUrl":"10.1007/s00236-022-00416-2","url":null,"abstract":"<div><p>The minimum status (or its normalized version called proximity) is a well-known concept in communication network theory. We determine the trees minimizing the minimum status among trees with a given degree sequence, and we show that the trees maximizing the minimum status among trees with a given degree sequence must be caterpillars with specific properties.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 1","pages":"1 - 10"},"PeriodicalIF":0.6,"publicationDate":"2022-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45578220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On Huang and Wong’s algorithm for generalized binary split trees","authors":"Marek Chrobak,&nbsp;Mordecai Golin,&nbsp;J. Ian Munro,&nbsp;Neal E. Young","doi":"10.1007/s00236-021-00411-z","DOIUrl":"10.1007/s00236-021-00411-z","url":null,"abstract":"<div><p>Huang and Wong (Acta Inform 21(1):113–123, 1984) proposed a polynomial-time dynamic-programming algorithm for computing optimal generalized binary split trees. We show that their algorithm is incorrect. Thus, it remains open whether such trees can be computed in polynomial time. Spuler (Optimal search trees using two-way key comparisons, PhD thesis, 1994) proposed modifying Huang and Wong’s algorithm to obtain an algorithm for a different problem: computing optimal two-way comparison search trees. We show that the dynamic program underlying Spuler’s algorithm is not valid, in that it does not satisfy the necessary optimal-substructure property and its proposed recurrence relation is incorrect. It remains unknown whether the algorithm is guaranteed to compute a correct overall solution.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 6","pages":"687 - 708"},"PeriodicalIF":0.6,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00411-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43409449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A jumping (5'rightarrow 3') Watson–Crick finite automata model","authors":"Radim Kocman,&nbsp;Zbyněk Křivka,&nbsp;Alexander Meduna,&nbsp;Benedek Nagy","doi":"10.1007/s00236-021-00413-x","DOIUrl":"10.1007/s00236-021-00413-x","url":null,"abstract":"<div><p>Jumping finite automata and sensing <span>(5'rightarrow 3')</span> Watson–Crick finite automata are finite-state models of computation which allow to process the input word not only in the strictly left-to-right manner. In this paper a new combined model of them is presented. The accepting power of the new model is studied and compared with the original models and also other well-known language families. Furthermore, the paper investigates changes in the accepting power when commonly studied restrictions from Watson–Crick finite automata, e.g., all states are final, are applied to this combined model. In the end, the paper presents a comprehensive hierarchy of all related language families.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"557 - 584"},"PeriodicalIF":0.6,"publicationDate":"2022-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50045696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction","authors":"Marcin Michalak","doi":"10.1007/s00236-021-00415-9","DOIUrl":"10.1007/s00236-021-00415-9","url":null,"abstract":"<div><p>Biclustering is a two-dimensional data analysis technique that, applied to a matrix, searches for a subset of rows and columns that intersect to produce a submatrix with given, expected features. Such an approach requires different methods to those of typical classification or regression tasks. In recent years it has become possible to express biclustering goals in the form of Boolean reasoning. This paper presents a new, heuristic approach to bicluster induction in binary data.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 6","pages":"673 - 685"},"PeriodicalIF":0.6,"publicationDate":"2022-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00415-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44249506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improved complement for two-way alternating automata","authors":"Viliam Geffert,&nbsp;Christos A. Kapoutsis,&nbsp;Mohammad Zakzok","doi":"10.1007/s00236-021-00414-w","DOIUrl":"10.1007/s00236-021-00414-w","url":null,"abstract":"<div><p>For each <i>two-way alternating finite automaton</i> (<span>a</span> <span>fa</span>) <i>A</i> with <i>s</i> states, we directly build a <span>a</span> <span>fa</span> <span>(A^c )</span> with <span>(O(s^6))</span> states which accepts exactly those inputs that are not accepted by <i>A</i>. This improves upon the previously best-known construction, which was both more expensive and more complicated, as it required <span>(O(s^7))</span> states and involved building and simulating an intermediate linear-bounded automaton.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"619 - 669"},"PeriodicalIF":0.6,"publicationDate":"2022-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00414-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46498404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Index appearance record with preorders","authors":"Jan Křetínský,&nbsp;Tobias Meggendorfer,&nbsp;Clara Waldmann,&nbsp;Maximilian Weininger","doi":"10.1007/s00236-021-00412-y","DOIUrl":"10.1007/s00236-021-00412-y","url":null,"abstract":"<div><p>Transforming <span>(omega )</span>-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"585 - 618"},"PeriodicalIF":0.6,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00412-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49413553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Correction to: Reactive synthesis without regret","authors":"Paul Hunter,&nbsp;Guillermo A. Pérez,&nbsp;Jean-François Raskin","doi":"10.1007/s00236-021-00410-0","DOIUrl":"10.1007/s00236-021-00410-0","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"671 - 671"},"PeriodicalIF":0.6,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48681144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}