標(biāo)題: Titlebook: Developments in Language Theory; 27th International C Frank Drewes,Mikhail Volkov Conference proceedings 2023 The Editor(s) (if applicable) [打印本頁(yè)] 作者: industrious 時(shí)間: 2025-3-21 16:55
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學(xué)科排名
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Developments in Language Theory被引頻次
書目名稱Developments in Language Theory被引頻次學(xué)科排名
書目名稱Developments in Language Theory年度引用
書目名稱Developments in Language Theory年度引用學(xué)科排名
書目名稱Developments in Language Theory讀者反饋
書目名稱Developments in Language Theory讀者反饋學(xué)科排名
作者: 起皺紋 時(shí)間: 2025-3-21 22:11
Isometric Words Based on Swap and Mismatch Distance, into the other one. A word . is said isometric with respect to an edit distance if, for any pair of .-free words . and ., there exists a transformation of minimal length from . to . via the related edit operations such that all the intermediate words are also .-free. The adjective “isometric” comes作者: entreat 時(shí)間: 2025-3-22 00:50
,Set Augmented Finite Automata over?Infinite Alphabets,ain defined over a countably infinite set). In this paper, we introduce set augmented finite automata (SAFA), a new class of automata for expressing data languages. SAFA is able to recognize data languages while storing a few data values in most cases. We investigate nonemptiness, membership, closur作者: SPASM 時(shí)間: 2025-3-22 04:39 作者: employor 時(shí)間: 2025-3-22 10:06
,Weak Inverse Neighborhoods of?Languages,al regex matching engines. This motivates us to introduce a new operation. We define the edit-distance interior operation on a language?. to compute the largest subset?.(.) of . such that the edit-distance neighborhood of .(.) is in .. In other words, . includes the edit-distance neighborhood of the作者: 態(tài)度暖昧 時(shí)間: 2025-3-22 15:57
,Bit Catastrophes for?the?Burrows-Wheeler Transform,g. We study this phenomenon for the Burrows-Wheeler Transform (BWT), a string transform at the heart of several of the most popular compressors and aligners today. The parameter determining the size of the compressed data is the number of equal-letter runs of the BWT, commonly denoted ...We exhibit 作者: 態(tài)度暖昧 時(shí)間: 2025-3-22 18:22 作者: 騎師 時(shí)間: 2025-3-22 21:44 作者: EVICT 時(shí)間: 2025-3-23 04:59
,Zielonka DAG Acceptance and?Regular Languages over?Infinite Words,ZA) and show that they are the first known automaton type with all of the following properties: .We compare Zielonka DAG acceptance to many other known acceptance types and give a complete description of their relative succinctness. Further, we show that non-deterministic Zielonka DAG automata turn 作者: 閑蕩 時(shí)間: 2025-3-23 08:47 作者: neologism 時(shí)間: 2025-3-23 12:40
,On the?Simon’s Congruence Neighborhood of?Languages,ost .. We extend Simon’s congruence to languages. First, we define the Simon’s congruence neighborhood of a language?. to be a set of strings that have a .-congruent string in .. Next, we define two languages?. and . to be .-congruent if both have the same Simon’s congruence neighborhood. We prove t作者: 有說(shuō)服力 時(shí)間: 2025-3-23 16:06
Tree-Walking-Storage Automata,ized stack automata, where the linear stack storage is replaced by a non-linear tree-like stack. Therefore, tree-walking-storage automata have the ability to explore the interior of the tree storage without altering the contents, where the possible moves of the tree pointer correspond to those of tr作者: Liberate 時(shí)間: 2025-3-23 18:05 作者: 吃掉 時(shí)間: 2025-3-23 22:12 作者: 有害處 時(shí)間: 2025-3-24 04:37
,Languages Generated by?Conjunctive Query Fragments of?FC[REG], conjunctive query fragments, . and .. We compare the expressive power of . to that of various related language generators, such as regular expressions, patterns, and typed patterns. We then consider decision problems for . and ., and show that certain static analysis problems (such as equivalence a作者: 改變 時(shí)間: 2025-3-24 08:26 作者: Forehead-Lift 時(shí)間: 2025-3-24 14:24 作者: overbearing 時(shí)間: 2025-3-24 15:32 作者: CLOT 時(shí)間: 2025-3-24 20:41
,On the?Simon’s Congruence Neighborhood of?Languages,hat it is .-complete to check .-congruence of two regular languages and decidable up to recursive languages. Moreover, we tackle the problem of computing the maximum . that makes two given languages .-congruent. This problem is .-complete for two regular languages, and undecidable for context-free languages.作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-25 03:09
,Approaching Repetition Thresholds via?Local Resampling and?Entropy Compression,pected from a purely information-theoretic considerations. In the second part, we present experimental results obtained by the mentioned algorithm in the extreme case of .-ary words avoiding .-powers.作者: Ascribe 時(shí)間: 2025-3-25 04:45 作者: 樂意 時(shí)間: 2025-3-25 09:07
J. Koscielny,H. Kiesewetter,A. Haa?ed, automata that can permute the word in windows of a given size k, and automata that can permute the word in windows of an existentially-quantified bound. We study expressiveness, closure properties and algorithmic properties of these models.作者: 眨眼 時(shí)間: 2025-3-25 14:31 作者: 反對(duì) 時(shí)間: 2025-3-25 16:33
Thrombozyt?re Signaltransduktionclasses of graphs - planar graphs, interval graphs, split graphs, co-bipartite graphs and line graphs - are shown to be two word-representable. An upper bound on the number of words needed to represent .colourable graphs has also been calculated.作者: Cardioversion 時(shí)間: 2025-3-25 22:28
Singers and Creativity in , and hat it is .-complete to check .-congruence of two regular languages and decidable up to recursive languages. Moreover, we tackle the problem of computing the maximum . that makes two given languages .-congruent. This problem is .-complete for two regular languages, and undecidable for context-free languages.作者: CLAMP 時(shí)間: 2025-3-26 03:14
https://doi.org/10.1007/978-3-662-63502-5pected from a purely information-theoretic considerations. In the second part, we present experimental results obtained by the mentioned algorithm in the extreme case of .-ary words avoiding .-powers.作者: Carminative 時(shí)間: 2025-3-26 06:35 作者: 展覽 時(shí)間: 2025-3-26 12:14
Conference proceedings 2023n, during June 12–16, 2023.?.The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited).The DLT conference series provides a forum for presenting current developments informal languages and automata. Its scope is very general a作者: 植物茂盛 時(shí)間: 2025-3-26 15:44
H?mofiltration, H?modialyse, H?mapheresestance interior operation whereas context-free languages are not. Then, we characterize the edit-distance interior languages and present a proper hierarchy with respect to the radius of operations. The family of edit-distance interior languages is closed under intersection, but not closed under union, complement and catenation.作者: 咒語(yǔ) 時(shí)間: 2025-3-26 18:00 作者: 不怕任性 時(shí)間: 2025-3-26 21:50
,Weak Inverse Neighborhoods of?Languages,stance interior operation whereas context-free languages are not. Then, we characterize the edit-distance interior languages and present a proper hierarchy with respect to the radius of operations. The family of edit-distance interior languages is closed under intersection, but not closed under union, complement and catenation.作者: cortisol 時(shí)間: 2025-3-27 03:33 作者: disrupt 時(shí)間: 2025-3-27 06:59
0302-9743 me?, Sweden, during June 12–16, 2023.?.The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited).The DLT conference series provides a forum for presenting current developments informal languages and automata. Its scope is very作者: Spinous-Process 時(shí)間: 2025-3-27 09:28
H?moperfusion bei akuten Vergiftungen. We consider the case of edit distance with swap and mismatch. We compare it with the case of mismatch only and prove some properties of isometric words that are related to particular features of their overlaps.作者: 發(fā)現(xiàn) 時(shí)間: 2025-3-27 16:46
E. Zadrobilek,V. Grabner,H. Andel,P. Spornalgorithm runs in linear time according to the size of .. The second result consists of the design of an algorithm to compute all the occurrences in a single sequence . of its target-specific factors against a reference .. The algorithm runs in real-time on the target sequence, independently of the number of occurrences of target-specific factors.作者: Ardent 時(shí)間: 2025-3-27 21:31 作者: 啞劇 時(shí)間: 2025-3-27 23:56
Isometric Words Based on Swap and Mismatch Distance,. We consider the case of edit distance with swap and mismatch. We compare it with the case of mismatch only and prove some properties of isometric words that are related to particular features of their overlaps.作者: nepotism 時(shí)間: 2025-3-28 03:00
,Fast Detection of?Specific Fragments Against a?Set of?Sequences,algorithm runs in linear time according to the size of .. The second result consists of the design of an algorithm to compute all the occurrences in a single sequence . of its target-specific factors against a reference .. The algorithm runs in real-time on the target sequence, independently of the number of occurrences of target-specific factors.作者: TOM 時(shí)間: 2025-3-28 06:58
,Synchronization of?Parikh Automata,when the dimension is fixed and the semilinear set is encoded in unary. For a binary encoding the problem remains .-hard even for unary two-state deterministic and complete Parikh automata of dimension one.作者: 玉米棒子 時(shí)間: 2025-3-28 12:11 作者: 粉筆 時(shí)間: 2025-3-28 15:08 作者: 排他 時(shí)間: 2025-3-28 19:06 作者: CALL 時(shí)間: 2025-3-28 23:22 作者: 聚集 時(shí)間: 2025-3-29 06:43
Conference proceedings 2023ecidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; and quantum computing..作者: OVER 時(shí)間: 2025-3-29 10:51 作者: Angioplasty 時(shí)間: 2025-3-29 15:13
J. Koscielny,H. Kiesewetter,A. Haa?e and study jumping automata over infinite words. Unlike the setting of finite words, which has been well studied, for infinite words it is not clear how words can be reordered. To this end, we consider three semantics: automata that read the infinite word in some order so that no letter is overlook作者: CLAP 時(shí)間: 2025-3-29 18:19 作者: 芳香一點(diǎn) 時(shí)間: 2025-3-29 20:26
https://doi.org/10.1007/978-3-642-78343-2ain defined over a countably infinite set). In this paper, we introduce set augmented finite automata (SAFA), a new class of automata for expressing data languages. SAFA is able to recognize data languages while storing a few data values in most cases. We investigate nonemptiness, membership, closur作者: 委派 時(shí)間: 2025-3-30 00:01
E. Zadrobilek,V. Grabner,H. Andel,P. Spornactor of a target . against a reference . is a factor . of a word in . which is not a factor of a word of . and such that any proper factor of . is a factor of a word of .. We first address the computation of the set of target-specific factors of a target . against a reference ., where . and . are f作者: Chipmunk 時(shí)間: 2025-3-30 04:47
H?mofiltration, H?modialyse, H?maphereseal regex matching engines. This motivates us to introduce a new operation. We define the edit-distance interior operation on a language?. to compute the largest subset?.(.) of . such that the edit-distance neighborhood of .(.) is in .. In other words, . includes the edit-distance neighborhood of the作者: ALIAS 時(shí)間: 2025-3-30 10:56
Aspekte der Betreuung H?mophiler in der DDRg. We study this phenomenon for the Burrows-Wheeler Transform (BWT), a string transform at the heart of several of the most popular compressors and aligners today. The parameter determining the size of the compressed data is the number of equal-letter runs of the BWT, commonly denoted ...We exhibit 作者: Gustatory 時(shí)間: 2025-3-30 14:43 作者: triptans 時(shí)間: 2025-3-30 19:12
Thrombozyt?re Signaltransduktionn is acceptable by an automaton of size .. Shortest paths in such an accepting automaton correspond to shortest synchronizing words. Here, we introduce completely distinguishable automata, a subclass of the synchronizing automata. Being completely distinguishable is a necessary condition for a minim作者: 威脅你 時(shí)間: 2025-3-30 23:21
Bernd P?tzsch,Katharina MadlenerZA) and show that they are the first known automaton type with all of the following properties: .We compare Zielonka DAG acceptance to many other known acceptance types and give a complete description of their relative succinctness. Further, we show that non-deterministic Zielonka DAG automata turn 作者: anthesis 時(shí)間: 2025-3-31 02:20 作者: crumble 時(shí)間: 2025-3-31 08:25
Singers and Creativity in , and ost .. We extend Simon’s congruence to languages. First, we define the Simon’s congruence neighborhood of a language?. to be a set of strings that have a .-congruent string in .. Next, we define two languages?. and . to be .-congruent if both have the same Simon’s congruence neighborhood. We prove t作者: crutch 時(shí)間: 2025-3-31 09:31 作者: 杠桿 時(shí)間: 2025-3-31 17:20 作者: 委屈 時(shí)間: 2025-3-31 21:10
https://doi.org/10.1007/978-3-662-63502-5is transformation can be made reversible by adding the log of the run of the algorithm to the output. We introduce a compression scheme for the logs; its analysis proves that .-powers and undirected .-powers can be avoided over . letters. These results are closer to the optimum than it is usually ex作者: 聯(lián)想 時(shí)間: 2025-4-1 01:11 作者: foreign 時(shí)間: 2025-4-1 03:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/270238.jpg作者: 反復(fù)拉緊 時(shí)間: 2025-4-1 09:13 作者: 過(guò)多 時(shí)間: 2025-4-1 11:19
