標(biāo)題: Titlebook: Developments in Language Theory; 23rd International C Piotrek Hofman,Micha? Skrzypczak Conference proceedings 2019 Springer Nature Switzerl [打印本頁(yè)] 作者: Optician 時(shí)間: 2025-3-21 19:55
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學(xué)科排名
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開(kāi)度
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開(kāi)度學(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 23:40 作者: Anguish 時(shí)間: 2025-3-22 04:21
T. Justin Clark M.B. Ch.B., M.D., F.R.C.O.G.sed under the reverse operation. The standard connections that exist between . and . logics and varieties of finite semigroups extend to this setting with semigroups extended with an involution. The case is different for . with neighbour relation where we show that one needs additional equations to characterise the class.作者: Diuretic 時(shí)間: 2025-3-22 05:34 作者: 散開(kāi) 時(shí)間: 2025-3-22 09:23 作者: 盡管 時(shí)間: 2025-3-22 16:05
Hypoxic Pulmonary Vasoconstrictionm. One can naturally build equations over contexts: the context variables are treated as symbols of arity one and a substitution . assigns to each such a variable a context .(.). A substitution . is extended to terms with context variables in a natural way: .(.(.)) is a context .(.) in which the uni作者: 盡管 時(shí)間: 2025-3-22 20:29 作者: 靦腆 時(shí)間: 2025-3-22 22:52
Radio-Imaging for Malignant Uterine Diseaserelating synchronizing automata and primitive sets, we study the length of the shortest product of a primitive set having a column or a row with . positive entries (the .-RT). We prove that this value is at most linear w.r.t. the matrix size . for small ., while the problem is still open for synchro作者: Estimable 時(shí)間: 2025-3-23 02:11 作者: 壁畫 時(shí)間: 2025-3-23 08:23 作者: 歌劇等 時(shí)間: 2025-3-23 12:19 作者: 嚴(yán)峻考驗(yàn) 時(shí)間: 2025-3-23 16:35 作者: Expand 時(shí)間: 2025-3-23 18:50
https://doi.org/10.1007/978-3-642-38218-5n problem, which is a crucial problem in formal verification. Input-driven languages are a robust subclass of context-free languages that enable to model program analysis questions within tractable time complexity. For instance, the language inclusion (or equivalence) problem is undecidable for cont作者: 不舒服 時(shí)間: 2025-3-23 22:22
T. Justin Clark M.B. Ch.B., M.D., F.R.C.O.G.tomata that are nondeterministic, window size one suffices, while for nondeterministic shrinking RWW-automata, we already need window size two to accept all growing context-sensitive languages. In the deterministic case, shrinking RWW- and RRWW-automata of window size one accept only regular languag作者: 新義 時(shí)間: 2025-3-24 02:59 作者: Pathogen 時(shí)間: 2025-3-24 08:45
https://doi.org/10.1007/978-3-319-57559-9model-checking for the corresponding class of models. Regular languages and visibly pushdown languages are paradigmatic examples of perfect languages. In a previous work authors have established a timed context-sensitive perfect language characterized by multistack pushdown automata (MPA) with an ex作者: 違抗 時(shí)間: 2025-3-24 11:41 作者: Decongestant 時(shí)間: 2025-3-24 15:05 作者: Arroyo 時(shí)間: 2025-3-24 23:04 作者: Myofibrils 時(shí)間: 2025-3-24 23:57
Risks and Complications of Hysteroscopyany cell in the first column of . with a path (inside .) which makes only North, South and East steps, and such that there is not a finite region of empty unitary squares which is surrounded by cells belonging to .. We provide a generation algorithm that allows us to enumerate . in constant amortize作者: AVID 時(shí)間: 2025-3-25 05:02
H?ndel-Jahrbuch 2022, 68. Jahrgangthe prefix of length . of . can be decomposed. In a 2013 paper with Puzynina and Zamboni we stated the conjecture that . is unbounded for every infinite word . which is not ultimately periodic. Up to now, the conjecture has been proved only for some particular cases including all fixed points of mor作者: Diatribe 時(shí)間: 2025-3-25 10:59
Logics for Reversible Regular Languages and Semigroups with Involutionsed under the reverse operation. The standard connections that exist between . and . logics and varieties of finite semigroups extend to this setting with semigroups extended with an involution. The case is different for . with neighbour relation where we show that one needs additional equations to characterise the class.作者: harangue 時(shí)間: 2025-3-25 13:50 作者: 商店街 時(shí)間: 2025-3-25 18:29
https://doi.org/10.1007/978-3-030-24886-4automata theory; context free languages; databases; finite automata; formal languages; linguistics; logic 作者: PALSY 時(shí)間: 2025-3-25 23:48
978-3-030-24885-7Springer Nature Switzerland AG 2019作者: Infant 時(shí)間: 2025-3-26 00:37
Conference proceedings 2019ugust 2019.?.The 20 full papers presented together with three invited talks were carefully?reviewed and selected from 30 submissions. The papers cover the?following topics and areas: combinatorial and algebraic properties??of words and languages; grammars, acceptors and transducers for?strings, tree作者: Insufficient 時(shí)間: 2025-3-26 05:14
0302-9743 land, in August 2019.?.The 20 full papers presented together with three invited talks were carefully?reviewed and selected from 30 submissions. The papers cover the?following topics and areas: combinatorial and algebraic properties??of words and languages; grammars, acceptors and transducers for?str作者: sebaceous-gland 時(shí)間: 2025-3-26 10:35 作者: AMOR 時(shí)間: 2025-3-26 16:34
Radio-Imaging for Malignant Uterine Diseasetic, this number is at least . and less than ., with the lower bound reached over an alphabet of size .. Furthermore, for deterministic automata and for a fixed alphabet of size ., the length of the shortest string is at least ..作者: 細(xì)查 時(shí)間: 2025-3-26 17:56 作者: persistence 時(shí)間: 2025-3-26 23:58
T. Justin Clark M.B. Ch.B., M.D., F.R.C.O.G.pt all growing context-sensitive languages. In the deterministic case, shrinking RWW- and RRWW-automata of window size one accept only regular languages, while those of window size two characterize the Church-Rosser languages. In addition, we study shrinking RWW- and RRWW-automata of window size one that are monotone.作者: Evolve 時(shí)間: 2025-3-27 03:49
Risks and Complications of Hysteroscopyn generates large and highly non-deterministic automata, we show how to exploit their specific structure and apply state-of-the art techniques based on coinduction to reduce the state-space that has to be explored. Doing so, we obtain algorithms which do not require full determinization or complementation.作者: 偽善 時(shí)間: 2025-3-27 06:26
0302-9743 relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional?patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing..978-3-030-24885-7978-3-030-24886-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 無(wú)目標(biāo) 時(shí)間: 2025-3-27 12:18
https://doi.org/10.1007/978-3-642-38218-5riven languages is decidable by designing a polynomial time IDPDA construction, based on the edit-distance, that recognizes a neighbourhood of a given input-driven language. In fact, the relative edit-distance problem between two input-driven languages turns out to be .-complete when the neighbourhood distance threshold is fixed as a constant.作者: 災(zāi)難 時(shí)間: 2025-3-27 15:10 作者: aviator 時(shí)間: 2025-3-27 20:28
H?ndel-Jahrbuch 2022, 68. Jahrgangisting techniques which can be used for lower bounds on the palindromic length. In particular, we completely describe the prefix palindromic length of the Thue-Morse word and use appropriate numeration systems to give a lower bound for the palindromic length of some Toeplitz words.作者: Nebulizer 時(shí)間: 2025-3-28 00:41 作者: Optimum 時(shí)間: 2025-3-28 02:15
On Timed Scope-Bounded Context-Sensitive Languagesre every stack symbol must be popped within a bounded number of stack contexts. The proposed model uses visibly-pushdown alphabet and event clocks to recover a bounded-scope MPA with decidable emptiness, closure under Boolean operations, and an equivalent logical characterization.作者: TEN 時(shí)間: 2025-3-28 06:20 作者: 暫停,間歇 時(shí)間: 2025-3-28 11:14 作者: Mri485 時(shí)間: 2025-3-28 14:34
Input-Driven Pushdown Automata for Edit Distance Neighborhoodtates, which improves the known upper bound. We have obtained also a lower bound, namely, at least . states are required. If the measure of edit distance includes also the operation of rewriting one symbol with another, the edit distance .-neighborhood can be recognized with . pushdown symbols and . states.作者: 貞潔 時(shí)間: 2025-3-28 21:45
Eventually Safe Languagesanguages. We introduce a class of properties called “eventually safe” together with a specification language . for this class. We finally give an algorithm to produce a Good-for-Games automaton from any . formula, thereby allowing synthesis for eventually safe properties.作者: DUCE 時(shí)間: 2025-3-28 23:58 作者: ADORN 時(shí)間: 2025-3-29 03:29
Sachin A. Gupte,Michael S. Wolin in the deterministic setting it allows for exponential succinctness compared to the classic types, boolean operations on it only involve a quadratic size blowup, and its nonemptiness, universality, and containment checks are in PTIME.作者: hieroglyphic 時(shí)間: 2025-3-29 09:22
Inherent Size Blowup in ,-Automata in the deterministic setting it allows for exponential succinctness compared to the classic types, boolean operations on it only involve a quadratic size blowup, and its nonemptiness, universality, and containment checks are in PTIME.作者: 饑荒 時(shí)間: 2025-3-29 12:20 作者: 不滿分子 時(shí)間: 2025-3-29 16:23 作者: 凹處 時(shí)間: 2025-3-29 23:39
Characterizing the Valuedness of Two-Way Finite Transducersalued or not. As crossing sequences in two-way automata often play similar roles as states in their one-way counterparts, we derive in this paper analogous criteria in the setting of crossing sequences to characterize the infinite-valuedness of two-way finite transducers.作者: 沉思的魚 時(shí)間: 2025-3-30 03:09 作者: Fracture 時(shí)間: 2025-3-30 06:48
Coinductive Algorithms for Büchi Automatan generates large and highly non-deterministic automata, we show how to exploit their specific structure and apply state-of-the art techniques based on coinduction to reduce the state-space that has to be explored. Doing so, we obtain algorithms which do not require full determinization or complementation.作者: Mercurial 時(shí)間: 2025-3-30 09:48
Indications for Oophorectomy and Adnexectomy on the length of shortest words of minimum rank in automata from the mentioned classes, and provide several families of automata with long words of minimum rank. Some results in this direction are also obtained for automata with rank equal to period (the greatest common divisor of lengths of all cycles) and for circular automata.作者: Conduit 時(shí)間: 2025-3-30 16:22
Hysteresis Phenomena in Biologytates, which improves the known upper bound. We have obtained also a lower bound, namely, at least . states are required. If the measure of edit distance includes also the operation of rewriting one symbol with another, the edit distance .-neighborhood can be recognized with . pushdown symbols and . states.作者: 監(jiān)禁 時(shí)間: 2025-3-30 19:57 作者: RLS898 時(shí)間: 2025-3-30 21:49
Inherent Size Blowup in ,-Automata reasons for the classic acceptance conditions, while there is also place for additional acceptance conditions, especially in the deterministic setting; Boolean operations on deterministic automata with the classic acceptance conditions involve an exponential size blowup, which can be avoided by usi作者: Glucose 時(shí)間: 2025-3-31 01:45 作者: 治愈 時(shí)間: 2025-3-31 06:55
Single-Stranded Architectures for Computingte DNA (transcription), it folds upon itself into intricate higher-dimensional structures in such a way that the free energy is minimized, that is, the more hydrogen bonds between ribonucletoides or larger entropy a structure has, the more likely it is chosen, and furthermore the minimization is don作者: Conserve 時(shí)間: 2025-3-31 11:42
A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matricesrelating synchronizing automata and primitive sets, we study the length of the shortest product of a primitive set having a column or a row with . positive entries (the .-RT). We prove that this value is at most linear w.r.t. the matrix size . for small ., while the problem is still open for synchro作者: 策略 時(shí)間: 2025-3-31 15:55
Words of Minimum Rank in Deterministic Finite Automatay the length of shortest words of minimum rank in several classes of complete deterministic finite automata, namely, strongly connected and Eulerian automata. A conjecture bounding this length is known as the Rank Conjecture, a generalization of the well known ?erny Conjecture. We prove upper bounds作者: Debark 時(shí)間: 2025-3-31 19:03
On the Length of Shortest Strings Accepted by Two-Way Finite Automata the maximum of these lengths over all .-state automata. It is proved that for .-state two-way finite automata, whether deterministic or nondeterministic, this number is at least . and less than ., with the lower bound reached over an alphabet of size .. Furthermore, for deterministic automata and f作者: Favorable 時(shí)間: 2025-4-1 01:42 作者: corporate 時(shí)間: 2025-4-1 03:36
