標題: Titlebook: Developments in Language Theory; 24th International C Nata?a Jonoska,Dmytro Savchuk Conference proceedings 2020 Springer Nature Switzerland [打印本頁] 作者: CK828 時間: 2025-3-21 19:24
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學科排名
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度學科排名
書目名稱Developments in Language Theory被引頻次
書目名稱Developments in Language Theory被引頻次學科排名
書目名稱Developments in Language Theory年度引用
書目名稱Developments in Language Theory年度引用學科排名
書目名稱Developments in Language Theory讀者反饋
書目名稱Developments in Language Theory讀者反饋學科排名
作者: acrobat 時間: 2025-3-21 22:26
J. Holfert,H. Thoms,E. Mylius,K. F. Jordan to intermediately produced strings. We consider semi-simple splicing systems where the axiom set is a regular language, and investigate the descriptional complexity of such systems in terms of the size of the minimal deterministic finite automata that recognize the languages they generate.作者: LAST 時間: 2025-3-22 01:57
Operations on Permutation Automata,dered operations is the same as for regular languages, except for quotients and cut. In case of quotients, it is?., and in case of cut, it is either?. or?., depending on whether there exists an integer?. with?. such that?..作者: 引起痛苦 時間: 2025-3-22 04:55 作者: 克制 時間: 2025-3-22 12:12 作者: Cantankerous 時間: 2025-3-22 14:51 作者: Cantankerous 時間: 2025-3-22 20:11 作者: 鑲嵌細工 時間: 2025-3-23 00:55
Conference proceedings 2020 selected from 38 submissions. The papers present current developments in language theory, formal languages, automata theory and related areas, such as algorithmic, combinatorial, and algebraic properties of words and languages, cellular automata, algorithms on words, etc..作者: OATH 時間: 2025-3-23 03:38
Andrea Albers,Jan-Hendrik Hinzkewould imply the existence of deterministic sub-exponential time algorithms for the simulation of nondeterministic linear space bounded computations. This consequence strengthens the existing conditional lower bounds for .-DFA-NEI and implies new non-uniform circuit lower bounds.作者: Ebct207 時間: 2025-3-23 08:03
Das Modell und seine empirische Fundierungalize the result to alphabets of the form . by showing that at most . scattered factors suffices to reconstruct .. Both results improve on the upper bounds known so far. Complexity time bounds on reconstruction algorithms are also considered here.作者: peptic-ulcer 時間: 2025-3-23 09:41 作者: 外向者 時間: 2025-3-23 14:11 作者: Commemorate 時間: 2025-3-23 19:27
https://doi.org/10.1007/978-3-531-91647-7ned by a synchronizing automaton in order to verify a certain stability condition: once again highlighting the existence of interesting intersections of the theory of . with various forms of formal language theory.作者: 危險 時間: 2025-3-24 00:47
https://doi.org/10.1007/978-3-531-91647-7w that the .-shortest string problem and the edit-distance problem with respect to finite languages are ., and the edit-distance problem with respect to regular languages is undecidable. In addition, we prove that it is impossible to compute a length bound?. of a PEG?. such that .(.) has a string . of length at most ..作者: 粗鄙的人 時間: 2025-3-24 03:50 作者: 消瘦 時間: 2025-3-24 08:28 作者: Influx 時間: 2025-3-24 14:09 作者: 言行自由 時間: 2025-3-24 17:58
Space Complexity of Stack Automata Models,he input word. However, this result does not hold for non-erasing stack automata; we provide an example when the space complexity grows with the square root of the input length. Furthermore, an investigation is done regarding the best complexity of any machine accepting a given language, and on decidability of space complexity properties.作者: overshadow 時間: 2025-3-24 20:29
0302-9743 e held in Tampa, Florida, USA, in May 2020. The conference was cancelled due to the COVID-19 pandemic...The 24 full papers presented were carefully reviewed and selected from 38 submissions. The papers present current developments in language theory, formal languages, automata theory and related are作者: Congestion 時間: 2025-3-25 02:01
Schule in Distanz – Kindheit in Kriseate to direct topological factorizations . of two nontrivial subshifts . and .. We also make some preliminary observations on direct topological factorizations of beta-shifts that are subshifts of finite type.作者: 愛國者 時間: 2025-3-25 05:44 作者: 輕率看法 時間: 2025-3-25 07:30
Die Wohnungseigentümer als Schuldnerality. After a series of preliminary combinatorial results, we present an algorithm computing, for a given .-universal word . the minimal . such that . is .-universal for some .. Several other connected problems are also considered.作者: 耕種 時間: 2025-3-25 11:40
,Schule als Fall – Zur Einführung,ords. We give a matching lower bound that holds even if .(.) is represented as an NFA. We then show that the same upper and lower bounds hold for an unambiguous finite-state transducer that computes .-successors.作者: 最高峰 時間: 2025-3-25 16:58 作者: 瑣碎 時間: 2025-3-25 23:15 作者: Strength 時間: 2025-3-26 01:45
The State Complexity of Lexicographically Smallest Words and Computing Successors,ords. We give a matching lower bound that holds even if .(.) is represented as an NFA. We then show that the same upper and lower bounds hold for an unambiguous finite-state transducer that computes .-successors.作者: 協(xié)議 時間: 2025-3-26 07:18
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata,der ACA (DACA) as a candidate for a decider counterpart to (acceptor) ACAs. We show the class of languages decidable in constant time by DACAs equals the locally testable languages, and we also determine . as the (tight) time complexity threshold for DACAs up?to which no advantage compared to constant time is possible.作者: 壕溝 時間: 2025-3-26 08:32
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection,would imply the existence of deterministic sub-exponential time algorithms for the simulation of nondeterministic linear space bounded computations. This consequence strengthens the existing conditional lower bounds for .-DFA-NEI and implies new non-uniform circuit lower bounds.作者: 微枝末節(jié) 時間: 2025-3-26 13:40 作者: MANIA 時間: 2025-3-26 18:51
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations,how they are built: one can ensure, for instance, that there are no two consecutive stars in regular expressions. This generalizes a former result where only one equation was allowed, confirming the lack of expressivity of uniform random expressions.作者: AGGER 時間: 2025-3-26 21:23
On Tree Substitution Grammars,n, nor intersection, nor complements. Indeed unions of tree substitution languages even generate an infinite hierarchy. However, all finite and all co-finite tree languages are tree substitution languages.作者: 文字 時間: 2025-3-27 02:53 作者: 漂泊 時間: 2025-3-27 07:18 作者: cogitate 時間: 2025-3-27 10:36 作者: 忙碌 時間: 2025-3-27 14:48
https://doi.org/10.1007/978-3-531-91647-7s non-amenable if and only if . has a simple reduced .-algebra..In further investigations into the structure of .-algebras, Breuillard, Kalantar, Kennedy, and Ozawa introduce the notion of a normalish subgroup of a group .. They show that if a group . admits no non-trivial finite normal subgroups an作者: 通知 時間: 2025-3-27 20:47
https://doi.org/10.1007/978-3-531-91647-7e shortest string problem. A parsing expression grammar?(PEG) is an unambiguous grammar such that the choice operator selects the first matching in PEG while it can be ambiguous in a context-free grammar. PEGs are also closely related to top-down parsing languages. We consider two problems on parsin作者: Rinne-Test 時間: 2025-3-28 01:59
Andrea Albers,Jan-Hendrik Hinzkertition of ., then . cannot be distinct. In this paper, we present a new approach to the Herzog-Sch?nheim conjecture based on automata and present a translation of the conjecture as a problem on automata.作者: 使聲音降低 時間: 2025-3-28 04:00
Andrea Albers,Jan-Hendrik Hinzkeifically, we are given a list . of DFA’s over a common alphabet ., and the goal is to determine whether .. This problem can be solved in time . by applying the classic Rabin-Scott product construction. In this work, we show that the existence of algorithms solving . . in time slightly faster than . 作者: Palpable 時間: 2025-3-28 07:43 作者: Irrigate 時間: 2025-3-28 13:34 作者: 向外供接觸 時間: 2025-3-28 15:49 作者: epicardium 時間: 2025-3-28 20:29 作者: atopic 時間: 2025-3-29 00:35
J. Holfert,H. Thoms,E. Mylius,K. F. Jordanne of a splicing system is the “splicing operation”, a cut-and-paste binary string operation defined by a set of “splicing rules”, quadruples . where . are words over an alphabet .. For two strings . and ., applying the splicing rule . produces the string .. In this paper we focus on a particular ty作者: 內(nèi)疚 時間: 2025-3-29 03:18
J. Holfert,H. Thoms,E. Mylius,K. F. Jordanthat there is an operator that has an absorbing pattern and prove that if we use this property to simplify a uniform random expression with . nodes, then the expected size of the result is bounded by a constant. In our framework, expressions are defined using a combinatorial system, which describes 作者: mastoid-bone 時間: 2025-3-29 07:40
Schule in Distanz – Kindheit in Krisentinuous direction whenever . is not sofic. This has the corollary that non-sofic beta-shifts are topologically direct prime, i.e. they are not conjugate to direct topological factorizations . of two nontrivial subshifts . and .. We also make some preliminary observations on direct topological facto作者: 浮夸 時間: 2025-3-29 14:27 作者: 多產(chǎn)子 時間: 2025-3-29 17:45
Historische Kompetenzen und das Internetmed if all words are prefixes of words in .. We show that well-formedness of a context-free language is decidable in polynomial time, and that the longest common reduced suffix can be computed in polynomial time. With this at a hand we decide for the class 2-. of non-linear tree transducers with out作者: ITCH 時間: 2025-3-29 20:10
Carsten Schulte,Maria Knobelsdorfis located strictly between the local tree grammars and the regular tree grammars. A decision procedure for the problem of determining whether a tree substitution grammar generates a local tree language is provided. Unfortunately, the class of tree substitution languages is neither closed under unio作者: Coronary 時間: 2025-3-30 03:43
Historische Kompetenzen und das Internet-time computation. The model considered is that of ACAs, which are language acceptors whose acceptance condition depends on the states of all cells in the automaton. We prove a time hierarchy theorem for sublinear-time ACA classes, analyze their intersection with the regular languages, and, finally,作者: FID 時間: 2025-3-30 05:11
https://doi.org/10.1007/978-3-658-31748-5A modifier is a .-ary operator acting on DFAs and producing a DFA. Modifiers are involved in the theory of state complexity. We define and study a class of simple modifiers, called product modifiers, and we link closely the regular operations they encode to boolean operations.作者: 不給啤 時間: 2025-3-30 12:05
Schule in Distanz – Kindheit in KriseLet . be a set of size 4 such that . cannot be obtained by applying the same affine function to all of the elements of .. We show that there is an infinite sequence of elements of . that contains no three consecutive blocks of same size and same sum (additive cubes). Moreover, it is possible to replace . by . in the statement.作者: interrupt 時間: 2025-3-30 15:36
A Study of a Simple Class of Modifiers: Product Modifiers,A modifier is a .-ary operator acting on DFAs and producing a DFA. Modifiers are involved in the theory of state complexity. We define and study a class of simple modifiers, called product modifiers, and we link closely the regular operations they encode to boolean operations.作者: 音樂戲劇 時間: 2025-3-30 18:40 作者: 遣返回國 時間: 2025-3-30 23:57 作者: 混亂生活 時間: 2025-3-31 02:39 作者: bisphosphonate 時間: 2025-3-31 06:56 作者: CRASS 時間: 2025-3-31 12:12 作者: Self-Help-Group 時間: 2025-3-31 16:42 作者: 極少 時間: 2025-3-31 20:59
978-3-030-48515-3Springer Nature Switzerland AG 2020作者: RACE 時間: 2025-3-31 23:52 作者: 誘導 時間: 2025-4-1 04:09
,An Approach to the Herzog-Sch?nheim Conjecture Using Automata,rtition of ., then . cannot be distinct. In this paper, we present a new approach to the Herzog-Sch?nheim conjecture based on automata and present a translation of the conjecture as a problem on automata.作者: Melatonin 時間: 2025-4-1 09:34 作者: Deject 時間: 2025-4-1 12:52
