標(biāo)題: Titlebook: Developments in Language Theory; 11th International C Tero Harju,Juhani Karhum?ki,Arto Lepist? Conference proceedings 2007 Springer-Verlag [打印本頁(yè)] 作者: Kennedy 時(shí)間: 2025-3-21 19:27
書目名稱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 21:51 作者: 單調(diào)女 時(shí)間: 2025-3-22 01:00
https://doi.org/10.1007/978-3-540-73208-2Automat; Variable; algorithm; algorithms; automata; complexity; complexity theory作者: 女歌星 時(shí)間: 2025-3-22 06:26
978-3-540-73207-5Springer-Verlag Berlin Heidelberg 2007作者: 移植 時(shí)間: 2025-3-22 12:00
H?ufige Hautkrankheiten im Kindesalterconcerning Mazurkiewicz traces can be seen as generalizations of those for words. It turns out that over traces it is crucial, how easy concurrency can be expressed. Since there is no concurrency in words, this distinction does not occur there. In general, the possibility of expressing concurrency a作者: 催眠藥 時(shí)間: 2025-3-22 14:53
https://doi.org/10.1007/978-3-642-44980-2rd either belongs to or does not belong to a language. Let . be an alphabet, and let us consider infinite words over?.. Formally, a . over . is a function .: .. There are many applications of qualitative languages. For example, qualitative languages are used to specify the legal behaviors of systems作者: 催眠藥 時(shí)間: 2025-3-22 20:51 作者: FEAT 時(shí)間: 2025-3-22 22:11 作者: 同步左右 時(shí)間: 2025-3-23 04:17 作者: noxious 時(shí)間: 2025-3-23 08:09 作者: 船員 時(shí)間: 2025-3-23 12:21
Hypertrophe Narben und Keloide,ce belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences..We firstly prove that the canonical coding partition of a regular set contains a fini作者: inveigh 時(shí)間: 2025-3-23 16:24 作者: Dislocation 時(shí)間: 2025-3-23 18:33
Sabine G. Pl?tz,Rüdiger Hein,Johannes Ring under two conditions: (1) uniform distribution on the words of given length and (2) uniform distribution on the traces of given height. In the first case, we give an approximability result showing a probabilistic fully polynomial time approximation scheme, while, in the second case, we prove that t作者: 外觀 時(shí)間: 2025-3-24 01:13
Anomalien und Fehlbildungen der Haut, shift-invariant (pseudo-)distance. We first give an original proof of the non-transitivity of cellular automata when the set of configurations is endowed with the Besicovitch pseudo-distance. We then show that the Besicovitch pseudo-distance induces a distance on the set of shift-invariant measures作者: Pelvic-Floor 時(shí)間: 2025-3-24 03:02
https://doi.org/10.1007/978-3-642-24702-6nection to the study of combinatorics on words. The theory of unavoidable sets has seen extensive study over the past twenty years. In this paper we extend the definition of unavoidable sets of words to unavoidable sets of partial words. Partial words, or finite sequences that may contain a number o作者: DALLY 時(shí)間: 2025-3-24 10:07 作者: 脖子 時(shí)間: 2025-3-24 14:35
Anomalien und Fehlbildungen der Haut,lled legal strings. It has been shown that reduction graphs, graphs that are based on the notion of breakpoint graph in the theory of sorting by reversal, for legal strings provide valuable insights into the gene assembly process. We characterize which legal strings obtain the same reduction graph (作者: Dri727 時(shí)間: 2025-3-24 15:50 作者: 飛鏢 時(shí)間: 2025-3-24 20:44 作者: exophthalmos 時(shí)間: 2025-3-25 00:32
Sabine G. Pl?tz,Rüdiger Hein,Tilo Biedermannsemiring of the real numbers can be solved numerically using Newton’s method. We generalize the method to any .-continuous semiring and show that it converges faster to the least fixed point than the Kleene sequence ., ., .(.),... We prove that the Newton approximants in the semiring of languages co作者: 畏縮 時(shí)間: 2025-3-25 04:53
https://doi.org/10.1007/978-3-658-23944-2inite deterministic automaton. The result is presented in two versions. The first version depends on Artin’s Conjecture (1927) in Number Theory. The second version does not depend on conjectures but the numerical estimates are worse. In both versions the method of the proof does not allow an explici作者: 博識(shí) 時(shí)間: 2025-3-25 10:51 作者: PATRI 時(shí)間: 2025-3-25 13:48 作者: 性學(xué)院 時(shí)間: 2025-3-25 17:32
What Do We Know About Language Equations?ypes of equations whose theory has not been successfully developed already in the previous decades, and on results forming the current borderline of our knowledge. This abstract is in particular meant to provide the interested listener with references to the material discussed in the talk.作者: Germinate 時(shí)間: 2025-3-25 21:38
Information Distance and Applications example: two genomes, two music scores, two programs, two articles, two emails, two concepts, or from a question to an answer? Furthermore, such a distance measure must be application-independent, must be universal in the sense it is provably better than all other distances, and must be applicable.作者: fabricate 時(shí)間: 2025-3-26 01:25
An Efficient Computation of the Equation ,-Automaton of a Regular ,-Expressionkarovitch. Our construction is based on an extension to regular .-expressions of the notion of c-continuation that we introduced to compute the equation automaton of a regular expression as a quotient of its position automaton.作者: 流眼淚 時(shí)間: 2025-3-26 05:20
Developments in Language Theory978-3-540-73208-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Sleep-Paralysis 時(shí)間: 2025-3-26 09:47
0302-9743 Overview: 978-3-540-73207-5978-3-540-73208-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: defray 時(shí)間: 2025-3-26 15:07 作者: 女歌星 時(shí)間: 2025-3-26 19:15
https://doi.org/10.1007/978-3-662-57447-8 example: two genomes, two music scores, two programs, two articles, two emails, two concepts, or from a question to an answer? Furthermore, such a distance measure must be application-independent, must be universal in the sense it is provably better than all other distances, and must be applicable.作者: 障礙 時(shí)間: 2025-3-26 22:44
Anomalien und Fehlbildungen der Haut,karovitch. Our construction is based on an extension to regular .-expressions of the notion of c-continuation that we introduced to compute the equation automaton of a regular expression as a quotient of its position automaton.作者: 監(jiān)禁 時(shí)間: 2025-3-27 02:55 作者: DOSE 時(shí)間: 2025-3-27 09:05
Hairpin Finite Automataanguages. Moreover, we show that in most cases we obtain incomparability results for the language families under consideration. Finally, we summarize closure properties of language families accepted by variants of hairpin finite automata.作者: Lacerate 時(shí)間: 2025-3-27 11:04 作者: OVER 時(shí)間: 2025-3-27 17:20 作者: 減震 時(shí)間: 2025-3-27 18:44 作者: 拾落穗 時(shí)間: 2025-3-28 01:48 作者: 熒光 時(shí)間: 2025-3-28 04:11 作者: Sputum 時(shí)間: 2025-3-28 06:49 作者: 圓木可阻礙 時(shí)間: 2025-3-28 11:00
Hypertrophe Narben und Keloide,te number of regular classes. We give an algorithm for computing this partition. We then investigate maximality conditions in a coding partition and we prove, in the regular case, the equivalence between two different notions of maximality. As an application, we finally derive some new properties of maximal uniquely decipherable codes.作者: 枯萎將要 時(shí)間: 2025-3-28 17:53
Emotionale St?rung mit Geschwisterrivalit?tehensively describe its relation to any .(..), .?≠?.. Our paper thus contributes fundamental (and, in parts, fairly counter-intuitive) results to the recently initiated research on the ambiguity of morphisms.作者: decode 時(shí)間: 2025-3-28 20:41 作者: 團(tuán)結(jié) 時(shí)間: 2025-3-29 00:42 作者: Obloquy 時(shí)間: 2025-3-29 05:18
https://doi.org/10.1007/978-3-7985-1926-8 class. Furthermore we show that, differently from the one-dimensional case, there exist many classes between deterministic and non-deterministic families that we separate by means of examples and decidability properties.作者: 孤僻 時(shí)間: 2025-3-29 08:40 作者: 你敢命令 時(shí)間: 2025-3-29 11:47 作者: AFFIX 時(shí)間: 2025-3-29 17:09
Anomalien und Fehlbildungen der Haut,sal, for legal strings provide valuable insights into the gene assembly process. We characterize which legal strings obtain the same reduction graph (up to isomorphism), and moreover we characterize which graphs are (isomorphic to) reduction graphs.作者: 大暴雨 時(shí)間: 2025-3-29 21:34 作者: GROG 時(shí)間: 2025-3-30 02:49
https://doi.org/10.1007/978-3-658-23944-2econd version does not depend on conjectures but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.作者: 亞麻制品 時(shí)間: 2025-3-30 04:52
https://doi.org/10.1007/978-3-642-21140-9cides the recognizability..Thus, the new model still cannot recognize the whole set of regular languages, however it enhances the understanding of what . be done in a finite-state real-time quantum process.作者: Nutrient 時(shí)間: 2025-3-30 09:57 作者: gruelling 時(shí)間: 2025-3-30 13:01
Multi-letter Reversible and Quantum Finite Automatacides the recognizability..Thus, the new model still cannot recognize the whole set of regular languages, however it enhances the understanding of what . be done in a finite-state real-time quantum process.作者: 核心 時(shí)間: 2025-3-30 20:29
2-Visibly Pushdown Automatality of emptiness can be recovered (preserving desirable closure properties) and solved in .. Using these properties along with the automata-theoretic approach, we prove that the model checking problem over 2-OVPA models against 2-OVPA specifications is .-complete.作者: 樂意 時(shí)間: 2025-3-30 22:09
On First-Order Fragments for Words and Mazurkiewicz Tracesconcerning Mazurkiewicz traces can be seen as generalizations of those for words. It turns out that over traces it is crucial, how easy concurrency can be expressed. Since there is no concurrency in words, this distinction does not occur there. In general, the possibility of expressing concurrency a作者: 多嘴 時(shí)間: 2025-3-31 02:27
Quantitative Generalizations of Languagesrd either belongs to or does not belong to a language. Let . be an alphabet, and let us consider infinite words over?.. Formally, a . over . is a function .: .. There are many applications of qualitative languages. For example, qualitative languages are used to specify the legal behaviors of systems作者: angiography 時(shí)間: 2025-3-31 08:21
What Do We Know About Language Equations?ypes of equations whose theory has not been successfully developed already in the previous decades, and on results forming the current borderline of our knowledge. This abstract is in particular meant to provide the interested listener with references to the material discussed in the talk.作者: 泥土謙卑 時(shí)間: 2025-3-31 12:45 作者: intimate 時(shí)間: 2025-3-31 16:24
Finite Automata and the Writing of Numbersence of digits once a base is fixed, rational numbers as a pair of integer or as an ultimately periodic infinite sequence of digits, or reals as an infinite sequence of digits but also as a continued fraction, just to quote a few. Operations on numbers are defined, independently of the way they are 作者: 酷熱 時(shí)間: 2025-3-31 20:08 作者: 原來(lái) 時(shí)間: 2025-3-31 22:30 作者: 千篇一律 時(shí)間: 2025-4-1 04:35
Multi-letter Reversible and Quantum Finite Automatanizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language..We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversib作者: CEDE 時(shí)間: 2025-4-1 07:59
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids under two conditions: (1) uniform distribution on the words of given length and (2) uniform distribution on the traces of given height. In the first case, we give an approximability result showing a probabilistic fully polynomial time approximation scheme, while, in the second case, we prove that t作者: 流逝 時(shí)間: 2025-4-1 14:03 作者: Lament 時(shí)間: 2025-4-1 17:52
Two Element Unavoidable Sets of Partial Wordsnection to the study of combinatorics on words. The theory of unavoidable sets has seen extensive study over the past twenty years. In this paper we extend the definition of unavoidable sets of words to unavoidable sets of partial words. Partial words, or finite sequences that may contain a number o作者: 機(jī)制 時(shí)間: 2025-4-1 19:11 作者: cartilage 時(shí)間: 2025-4-2 01:43
Characterizing Reduction Graphs for Gene Assembly in Ciliateslled legal strings. It has been shown that reduction graphs, graphs that are based on the notion of breakpoint graph in the theory of sorting by reversal, for legal strings provide valuable insights into the gene assembly process. We characterize which legal strings obtain the same reduction graph (作者: Eclampsia 時(shí)間: 2025-4-2 05:44
2-Visibly Pushdown Automata, namely .. These automata introduce a useful model to effectively describe concurrent pushdown systems using a simple communication mechanism between stacks. We show that 2-VPA are strictly more expressive than VPA. Indeed, 2-VPA accept some context-sensitive languages that are not context-free and作者: 輕推 時(shí)間: 2025-4-2 07:13
An Efficient Computation of the Equation ,-Automaton of a Regular ,-Expressionkarovitch. Our construction is based on an extension to regular .-expressions of the notion of c-continuation that we introduced to compute the equation automaton of a regular expression as a quotient of its position automaton.作者: insidious 時(shí)間: 2025-4-2 13:23
An Extension of Newton’s Method to ,-Continuous Semiringssemiring of the real numbers can be solved numerically using Newton’s method. We generalize the method to any .-continuous semiring and show that it converges faster to the least fixed point than the Kleene sequence ., ., .(.),... We prove that the Newton approximants in the semiring of languages co作者: 流動(dòng)性 時(shí)間: 2025-4-2 17:43 作者: 溫和女人 時(shí)間: 2025-4-2 21:20
The Unambiguity of Segmented Morphismsct of . on the unambiguity of .. with respect to any .?∈?.., i. e.?the question of whether there does not exist a morphism . satisfying .(.)?=?..(.) and, for some symbol . in ., .(.)?≠?..(.). To this end, we consider the set .(..) of those .?∈?.. with respect to which .. is unambiguous, and we compr
