標(biāo)題: Titlebook: Developments in Language Theory; 13th International C Volker Diekert,Dirk Nowotka Conference proceedings 2009 Springer-Verlag Berlin Heidel [打印本頁] 作者: affront 時間: 2025-3-21 19:34
書目名稱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é)科排名
作者: concentrate 時間: 2025-3-21 20:54
Principles of Hypospadias Surgeryll words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of finite words of length . avoidi作者: 我的巨大 時間: 2025-3-22 03:42 作者: 拋射物 時間: 2025-3-22 04:52
Thyrotropin and Thyroid Hormonesan be expressed in terms of a common word . and its complement .(.). Moreover, if .?≥?5, then .?=?.?=?3 is an optimal bound. We also obtain a complete characterization of all possible overlaps between two expressions that involve only some word . and its complement .(.).作者: 事先無準(zhǔn)備 時間: 2025-3-22 12:15
Traces of Control-Flow Graphs unambiguously represent traces. Within the family of local languages with the same C-dependences, we construct the language such that instructions are maximally anticipated. This language differs from the Foata-Cartier normal form. Future directions for application of trace theory to program optimization are outlined.作者: 睨視 時間: 2025-3-22 16:34
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Wordsan be expressed in terms of a common word . and its complement .(.). Moreover, if .?≥?5, then .?=?.?=?3 is an optimal bound. We also obtain a complete characterization of all possible overlaps between two expressions that involve only some word . and its complement .(.).作者: 睨視 時間: 2025-3-22 19:36 作者: paleolithic 時間: 2025-3-23 00:12 作者: Detain 時間: 2025-3-23 04:05 作者: 先行 時間: 2025-3-23 08:27
Somatostatin and the Endocrine Pancreas by Horváth et al. for various kinds of exponent sets for the powers and regular languages which have primitive roots satisfying certain properties. We show that the regular languages which have a regular power are the ones which are ’almost’ equal to their Kleene-closure.作者: 支柱 時間: 2025-3-23 09:53
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automatadenote by . ·. the state reached from . by the path labeled .). As a consequence, we show that for any finite synchronized prefix code with an .-state decoder, there is a synchronizing word of length .(..). This applies in particular to Huffman codes.作者: Brain-Imaging 時間: 2025-3-23 16:11
Strongly Regular Grammars and Regular Approximation of Context-Free Languagesar. In another direction, the generalization by a 1–lookahead extends Mohri and Nederhof’s transformation by incorporating more context into the regular approximation at the expense of a larger grammar.作者: EWER 時間: 2025-3-23 22:01 作者: calumniate 時間: 2025-3-24 00:52
Weighted versus Probabilistic LogicsL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL. We establish expressiveness results on our logics giving translations from weighted and probabilistic CTL into weighted MSO.作者: CRATE 時間: 2025-3-24 03:27 作者: albuminuria 時間: 2025-3-24 09:14 作者: 喊叫 時間: 2025-3-24 14:42
Powers of Regular Languages by Horváth et al. for various kinds of exponent sets for the powers and regular languages which have primitive roots satisfying certain properties. We show that the regular languages which have a regular power are the ones which are ’almost’ equal to their Kleene-closure.作者: 平息 時間: 2025-3-24 15:45
PTH Assays and Their Clinical Significancedenote by . ·. the state reached from . by the path labeled .). As a consequence, we show that for any finite synchronized prefix code with an .-state decoder, there is a synchronizing word of length .(..). This applies in particular to Huffman codes.作者: 切割 時間: 2025-3-24 21:29
Hypothalamus and Endocrine Functionsar. In another direction, the generalization by a 1–lookahead extends Mohri and Nederhof’s transformation by incorporating more context into the regular approximation at the expense of a larger grammar.作者: Eclampsia 時間: 2025-3-25 00:24
Joseph Meites,H. H. Huang,G. D. Riegleu (. 50, 1994). Since the problem of whether a pattern is descriptive depends on the inclusion relation of so-called pattern languages, our technical considerations lead to a number of deep insights into the inclusion problem for and the topology of the class of terminal-free E-pattern languages.作者: 堅毅 時間: 2025-3-25 03:36
Gerald R. Cunha,Laurence Baskin that there is a clopen partition separating two words if and only if the words do not commute. We can decide in quadratic time if the language specified by a DFA is closed, but if the language is specified by an NFA, the problem is PSPACE-complete.作者: Malfunction 時間: 2025-3-25 09:40 作者: leniency 時間: 2025-3-25 12:45
Closures in Formal Languages and Kuratowski’s Theorem that there is a clopen partition separating two words if and only if the words do not commute. We can decide in quadratic time if the language specified by a DFA is closed, but if the language is specified by an NFA, the problem is PSPACE-complete.作者: 不整齊 時間: 2025-3-25 19:34
On Stateless Multihead Finite Automata and Multihead Pushdown Automatatter than . heads..We also study stateless multihead pushdown automata in their two-way and one-way, deterministic and nondeterministic variations and show that for all these varieties, .?+?1 heads allow more computational power than . heads. Finally, we give some characterizations of stateless multihead finite and multihead pushdown automata.作者: Campaign 時間: 2025-3-25 22:46 作者: FRAX-tool 時間: 2025-3-26 02:38
0302-9743 Overview: 978-3-642-02736-9978-3-642-02737-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 思想流動 時間: 2025-3-26 06:29 作者: Allowance 時間: 2025-3-26 10:15 作者: Rejuvenate 時間: 2025-3-26 15:35
Phosphate Control of PTH Secretion{.,.}.. For the subclass of automata whose transition monoids have the property that each regular -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.作者: 和平主義 時間: 2025-3-26 17:16
Ned J. Place,Stephen E. Glickmanelating them with . words. In particular, some new characterizations of rich words and rich palindromes are given. We also prove that a periodic-like word is rich if and only if the square of its fractional root is also rich.作者: 散布 時間: 2025-3-27 00:30
https://doi.org/10.1007/978-3-642-02737-6Alphabet; Erfüllbarkeitsproblem der Aussagenlogik; Kuratowski; Variable; automata; automata theory; boolea作者: Project 時間: 2025-3-27 05:11 作者: Atrium 時間: 2025-3-27 08:56
Gregory D. Judy,Bhishamjit S. CheraA survey of applications of factorization forests.作者: AER 時間: 2025-3-27 10:27
Endocrine Disruption and HypospadiasIn this paper, we study rational relations that are both left and right synchronous. We show that these relations are boolean combinations of almost length preserving relations, length comparing relations and recognizable relations.作者: ESPY 時間: 2025-3-27 14:45 作者: landmark 時間: 2025-3-27 18:58 作者: legislate 時間: 2025-3-27 22:03 作者: 問到了燒瓶 時間: 2025-3-28 03:17 作者: FUME 時間: 2025-3-28 07:43
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/270234.jpg作者: Tincture 時間: 2025-3-28 14:15
Post Correspondence Problem and Small Dimensional Matricese Post Correspondence Problem. The presentation is based on the article Halava et al. “Undecidability bounds for integer matrices using Claus instances” (Internat. J. Foundations of Comput. Sci. 18, 2007, 931–948).作者: 參考書目 時間: 2025-3-28 14:57
Size Complexity of Two-Way Finite Automataall its early history, and introduce some of the concepts used in its study. We then sketch a possible future, describe a natural systematic way of pursuing it, and record some of the progress that has been achieved. We add little to what is already known—only exposition, terminology, and questions.作者: 吹氣 時間: 2025-3-28 19:09
Matrix Mortality and the ?erny-Pin Conjecture{.,.}.. For the subclass of automata whose transition monoids have the property that each regular -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.作者: 會議 時間: 2025-3-29 00:12 作者: Inertia 時間: 2025-3-29 03:33
Jason Matney,Alex Price,Leith Rankinek such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL. We establish expressiveness results on our lo作者: 精美食品 時間: 2025-3-29 08:36
https://doi.org/10.1007/978-3-319-53348-3e Post Correspondence Problem. The presentation is based on the article Halava et al. “Undecidability bounds for integer matrices using Claus instances” (Internat. J. Foundations of Comput. Sci. 18, 2007, 931–948).作者: 鬧劇 時間: 2025-3-29 12:03
Hyponormal Quantization of Planar Domainsall its early history, and introduce some of the concepts used in its study. We then sketch a possible future, describe a natural systematic way of pursuing it, and record some of the progress that has been achieved. We add little to what is already known—only exposition, terminology, and questions.作者: gnarled 時間: 2025-3-29 15:40
Phosphate Control of PTH Secretion{.,.}.. For the subclass of automata whose transition monoids have the property that each regular -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.作者: archaeology 時間: 2025-3-29 23:24
PTH Assays and Their Clinical Significancerove a quadratic upper bound on the length of a synchronizing word for any synchronized .-state deterministic automaton satisfying the following additional property: there is a letter . such that for any pair of states .,., one has . ·..?=?. ·.. for some integers .,. (for a state . and a word ., we 作者: FRET 時間: 2025-3-29 23:56 作者: PAN 時間: 2025-3-30 06:08
https://doi.org/10.1007/978-3-662-07841-9 word in the monoid defined by a complete string rewrite system. We prove that, if the monoid is cancellative, then our inclusion problem is polynomially reducible to the problem of testing equivalence of straight-line programs in the same monoid. As an application, we obtain a polynomial time algor作者: 舊病復(fù)發(fā) 時間: 2025-3-30 09:55
Principles of Hypospadias Surgeryis .-hard [Theoret. Comput. Sci. . (2009) 968–972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are .-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish作者: Evocative 時間: 2025-3-30 13:16
Gerald R. Cunha,Laurence Baskinclosure and complement to a given set. We re-examine this theorem in the setting of formal languages, where closure is either Kleene closure or positive closure. We classify languages according to the structure of the algebra they generate under iterations of complement and closure. There are precis作者: tangle 時間: 2025-3-30 19:49 作者: figure 時間: 2025-3-30 21:25 作者: A精確的 時間: 2025-3-31 01:14
Thyrotropin and Thyroid Hormonesment, denoted here as .(.). Thus, any expression consisting of repetitions of . and .(.) can be considered in some sense periodic. In this paper we give a generalization of Lyndon and Schützenberger’s classical result about equations of the form ..?=?...., to cases where both sides involve repetitio作者: xanthelasma 時間: 2025-3-31 07:45 作者: 青少年 時間: 2025-3-31 10:49
Somatostatin and the Endocrine Pancreas is regular or not. The problem was originally posed by Calbrix and Nivat in 1995. Partial solutions have been given by Cachat for unary languages and by Horváth et al. for various kinds of exponent sets for the powers and regular languages which have primitive roots satisfying certain properties. W作者: 排他 時間: 2025-3-31 16:59 作者: DEMUR 時間: 2025-3-31 20:50 作者: Tartar 時間: 2025-3-31 22:30
Weighted versus Probabilistic Logicsk such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL. We establish expressiveness results on our lo作者: barium-study 時間: 2025-4-1 04:02
Post Correspondence Problem and Small Dimensional Matricese Post Correspondence Problem. The presentation is based on the article Halava et al. “Undecidability bounds for integer matrices using Claus instances” (Internat. J. Foundations of Comput. Sci. 18, 2007, 931–948).作者: patriot 時間: 2025-4-1 09:01
Size Complexity of Two-Way Finite Automataall its early history, and introduce some of the concepts used in its study. We then sketch a possible future, describe a natural systematic way of pursuing it, and record some of the progress that has been achieved. We add little to what is already known—only exposition, terminology, and questions.作者: promote 時間: 2025-4-1 13:32
Matrix Mortality and the ?erny-Pin Conjecture{.,.}.. For the subclass of automata whose transition monoids have the property that each regular -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.作者: 環(huán)形 時間: 2025-4-1 15:12
