標(biāo)題: Titlebook: Developments in Language Theory; 19th International C Igor Potapov Conference proceedings 2015 Springer International Publishing Switzerlan [打印本頁] 作者: 手鐲 時(shí)間: 2025-3-21 16:28
書目名稱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 20:30
Garside and Quadratic Normalisation: A Survey,ain how it extends to the more general framework of Garside families. Extending the viewpoint even more, we then consider general quadratic normalisation procedures and characterise Garside normalisation among them.作者: antipsychotic 時(shí)間: 2025-3-22 03:10 作者: Individual 時(shí)間: 2025-3-22 08:14
Ergodic Infinite Permutations of Minimal Complexity, a function counting the number of its factors of length .. For infinite words, a classical result of Morse and Hedlund, 1940, states that if the complexity of an infinite word satisfies . for some ., then the word is ultimately periodic. Hence minimal complexity of aperiodic words is equal to ., an作者: 糾纏 時(shí)間: 2025-3-22 12:37 作者: 托人看管 時(shí)間: 2025-3-22 14:55 作者: 托人看管 時(shí)間: 2025-3-22 19:15
On the Size of Two-Way Reasonable Automata for the Liveness Problem,is problem is also related to the famous DLOG vs. NLOG question. An exponential gap between the number of states of two-way nondeterministic automata (.s) and their deterministic counterparts (.s) has been proved only for some restrictions of .s up to now. It seems that the hardness of this problem 作者: 不能和解 時(shí)間: 2025-3-22 23:20
Squareable Words,th don’t cares, with the restriction that no two holes may be within distance two. We present and prove a necessary and sufficient condition for a word of even length (at least eight) to not derive any squares (such word is called non-squareable). The condition can be decided in .(.) time, where . i作者: CT-angiography 時(shí)間: 2025-3-23 01:30 作者: 厭惡 時(shí)間: 2025-3-23 07:51 作者: 不出名 時(shí)間: 2025-3-23 13:37
Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts, shifts constitute a subclass of these sets of sequences. A (one-sided) finite-type-Dyck shift is defined as the set of infinite sequences avoiding both some finite set of words and some finite set of matching patterns. We prove that proper conjugacy is decidable for a large class of one-sided finit作者: Spartan 時(shí)間: 2025-3-23 17:26
Transfinite Lyndon Words,e exists a unique factorization in Lyndon words that are locally decreasing, a relaxation of the condition used in the case of finite words..In a second part, we prove that the factorization of a rational word has a special form and that it can be computed in polynomial time from a rational expressi作者: Benign 時(shí)間: 2025-3-23 18:56
Unary Patterns with Permutations,idance of patterns with palindromes, avoidance of powers under coding, and other questions of recent interest. Unary patterns with permutations have been previously analysed only for lengths up to 3. Consider a pattern ., with ., . a word variable over an alphabet . and . function variables, to be r作者: Intellectual 時(shí)間: 2025-3-24 00:39
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change,c formulas that connect properties of successive letters. In the second, the letters are considered as columns of a labeled grid which an automaton traverses column by column. Thus, both models focus on the comparison of successive letters, i.e. “l(fā)ocal changes”. We prove closure (and non-closure) pr作者: 真實(shí)的你 時(shí)間: 2025-3-24 03:08 作者: expeditious 時(shí)間: 2025-3-24 07:46 作者: conceal 時(shí)間: 2025-3-24 11:39
*-Continuous Kleene ,-Algebras,module and an infinite product operation that is also .-continuous. We show that .-continuous Kleene .-algebras give rise to iteration semiring-semimodule pairs, and that for Büchi automata over .-continuous Kleene .-algebras, one can compute the associated infinitary power series.作者: cortex 時(shí)間: 2025-3-24 15:26 作者: intuition 時(shí)間: 2025-3-24 20:28 作者: ORBIT 時(shí)間: 2025-3-25 02:31
Hypothesis-Driven Simulation Studiestion “up to permutation” and “up to subset”. Although all these variations have been considered before, it appears that the languages of words having these properties have not been positioned in the Chomsky hierarchy up to now. We also consider the length of the shortest word . having the desired property.作者: contrast-medium 時(shí)間: 2025-3-25 04:39
Factorization in Formal Languages,tion “up to permutation” and “up to subset”. Although all these variations have been considered before, it appears that the languages of words having these properties have not been positioned in the Chomsky hierarchy up to now. We also consider the length of the shortest word . having the desired property.作者: 雜色 時(shí)間: 2025-3-25 08:40 作者: Thyroxine 時(shí)間: 2025-3-25 14:23
Silvia Pastorekova,Claudiu T. Supuranaverses column by column. Thus, both models focus on the comparison of successive letters, i.e. “l(fā)ocal changes”. We prove closure (and non-closure) properties, show the decidability of the respective non-emptiness problems, prove limits on decidability results for extended models, and discuss open issues in the development of a generalized theory.作者: conservative 時(shí)間: 2025-3-25 17:47
Photoacoustic Lifetime Imaging of Hypoxias. It contains also strictly all extensible one-sided shifts of finite type. Our result is thus an extension of the decidability of conjugacy between one-sided shifts of finite type obtained by Williams.作者: Budget 時(shí)間: 2025-3-25 22:24
https://doi.org/10.1007/978-1-0716-3633-6 all . are powers of a single ., the length restriction is removed. In general, the restriction on . cannot be removed, even for powers of permutations: for every positive integer . there exists . and a pattern . which is unavoidable over all ..作者: 有花 時(shí)間: 2025-3-26 02:33 作者: 調(diào)整 時(shí)間: 2025-3-26 07:26 作者: cluster 時(shí)間: 2025-3-26 09:08 作者: BRAND 時(shí)間: 2025-3-26 12:43
https://doi.org/10.1007/978-3-642-67418-1tegies in such games can be described by context-sensitive languages. We also discuss consensus game acceptors with a restricted observation pattern that describe nondeterministic linear-time languages.作者: Cosmopolitan 時(shí)間: 2025-3-26 20:35
Consensus Game Acceptors,tegies in such games can be described by context-sensitive languages. We also discuss consensus game acceptors with a restricted observation pattern that describe nondeterministic linear-time languages.作者: mosque 時(shí)間: 2025-3-26 22:02 作者: 邊緣帶來墨水 時(shí)間: 2025-3-27 04:55
Hypothesis-Driven Simulation Studiesterval. We show that the minimal complexity of an ergodic permutation is ., and that the class of ergodic permutations of minimal complexity coincides with the class of so-called Sturmian permutations, directly related to Sturmian words.作者: 閃光東本 時(shí)間: 2025-3-27 08:31
Kyle T. S. Pattinson,Richard G. Wiseng some properties of the input word, and transitions are designed to maintain consistency within this setting. In this paper we extend the study, started in [.], of the descriptional complexity of .s solving the liveness problem, showing several lower and upper bounds for different choices of allow作者: FLACK 時(shí)間: 2025-3-27 09:48 作者: 單挑 時(shí)間: 2025-3-27 16:14 作者: 不整齊 時(shí)間: 2025-3-27 19:51
On the Size of Two-Way Reasonable Automata for the Liveness Problem,ng some properties of the input word, and transitions are designed to maintain consistency within this setting. In this paper we extend the study, started in [.], of the descriptional complexity of .s solving the liveness problem, showing several lower and upper bounds for different choices of allow作者: armistice 時(shí)間: 2025-3-28 01:50 作者: itinerary 時(shí)間: 2025-3-28 05:18 作者: 一加就噴出 時(shí)間: 2025-3-28 08:47
John T. Povlishock,Yuji Ueda,Enoch P. Weiain how it extends to the more general framework of Garside families. Extending the viewpoint even more, we then consider general quadratic normalisation procedures and characterise Garside normalisation among them.作者: 時(shí)代 時(shí)間: 2025-3-28 10:25
Florian G. Hartmann,Daniel Loislso for the . fragment. In particular, the decidability for . is obtained. More generally, for every concatenation hierarchy of regular languages, it is proved that decidability of one of its half levels implies decidability of the intersection of the following half level with its complement.作者: entail 時(shí)間: 2025-3-28 16:26 作者: agitate 時(shí)間: 2025-3-28 18:46
Hypothesis-Driven Simulation Studiesaving unique factorization into elements of . is regular if . is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(.). We observe that uf(.) need not be context-free if . is context-free..Next, we consider some variations on unique factoriz作者: eardrum 時(shí)間: 2025-3-29 01:32
https://doi.org/10.1007/978-3-642-67418-1te input strings correlated by a finite graph. The players have a joint objective to avoid an inadmissible decision, in spite of the uncertainty induced by the input..We show that the acceptor model based on consensus games characterises context-sensitive languages, and conversely, that winning stra作者: 有偏見 時(shí)間: 2025-3-29 04:15 作者: Valves 時(shí)間: 2025-3-29 08:29
Kyle T. S. Pattinson,Richard G. Wiseth don’t cares, with the restriction that no two holes may be within distance two. We present and prove a necessary and sufficient condition for a word of even length (at least eight) to not derive any squares (such word is called non-squareable). The condition can be decided in .(.) time, where . i作者: Intentional 時(shí)間: 2025-3-29 13:37
https://doi.org/10.1007/978-1-4899-7678-9s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations, these problems are closely linked with each other. 作者: 昏睡中 時(shí)間: 2025-3-29 17:26
https://doi.org/10.1007/978-1-0716-3633-6of the free monoid .. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree.作者: 新奇 時(shí)間: 2025-3-29 21:04 作者: Retrieval 時(shí)間: 2025-3-30 00:34
https://doi.org/10.1007/978-1-0716-3633-6e exists a unique factorization in Lyndon words that are locally decreasing, a relaxation of the condition used in the case of finite words..In a second part, we prove that the factorization of a rational word has a special form and that it can be computed in polynomial time from a rational expressi作者: BANAL 時(shí)間: 2025-3-30 04:12 作者: 緊張過度 時(shí)間: 2025-3-30 09:33 作者: Custodian 時(shí)間: 2025-3-30 13:42
Hypoxia and Breast Cancer Metastasisons of nonempty words. These formulae concern return words and bifix codes. They generalize formulae previously known for Sturmian sets or more generally for tree sets. We also give a geometric example of this class of sets, namely the natural coding of some interval exchange transformations.作者: 斗爭 時(shí)間: 2025-3-30 17:32 作者: Alopecia-Areata 時(shí)間: 2025-3-30 22:10 作者: Neuropeptides 時(shí)間: 2025-3-31 01:16
https://doi.org/10.1007/978-4-431-53961-2This paper gives a survey on recent progress in grammar-based compression for trees. Also algorithms that directly work on grammar-compressed trees will be surveyed.作者: 追逐 時(shí)間: 2025-3-31 06:13
Hypothesis-Driven Simulation StudiesWe prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.作者: 墊子 時(shí)間: 2025-3-31 13:08 作者: 改正 時(shí)間: 2025-3-31 14:24
Diverse Palindromic Factorization Is NP-complete,We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.作者: nullify 時(shí)間: 2025-3-31 20:38 作者: Hirsutism 時(shí)間: 2025-3-31 23:48
Hypothermia for Acute Brain Damageomes with a standard notion of an algebra, called an Eilenberg-Moore algebra, which generalises algebras studied in language theory like semigroups or .-semigroups. On the abstract level of monads one can prove theorems like the Myhill-Nerode theorem, the Eilenberg theorem; one can also define profinite objects.作者: 不可思議 時(shí)間: 2025-4-1 05:09
John T. Povlishock,Yuji Ueda,Enoch P. Weiain how it extends to the more general framework of Garside families. Extending the viewpoint even more, we then consider general quadratic normalisation procedures and characterise Garside normalisation among them.作者: monogamy 時(shí)間: 2025-4-1 08:12
Florian G. Hartmann,Daniel Loislso for the . fragment. In particular, the decidability for . is obtained. More generally, for every concatenation hierarchy of regular languages, it is proved that decidability of one of its half levels implies decidability of the intersection of the following half level with its complement.作者: Sinus-Rhythm 時(shí)間: 2025-4-1 11:46
Kyle T. S. Pattinson,Richard G. Wiseth don’t cares, with the restriction that no two holes may be within distance two. We present and prove a necessary and sufficient condition for a word of even length (at least eight) to not derive any squares (such word is called non-squareable). The condition can be decided in .(.) time, where . is the length of the word.作者: configuration 時(shí)間: 2025-4-1 18:16
https://doi.org/10.1007/978-1-4899-7678-9s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations, these problems are closely linked with each other. We show that all of them are PSPACE-complete.作者: mitten 時(shí)間: 2025-4-1 19:28
https://doi.org/10.1007/978-1-0716-3633-6of the free monoid .. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree.作者: flavonoids 時(shí)間: 2025-4-2 00:56
https://doi.org/10.1007/978-1-0716-3633-6e exists a unique factorization in Lyndon words that are locally decreasing, a relaxation of the condition used in the case of finite words..In a second part, we prove that the factorization of a rational word has a special form and that it can be computed in polynomial time from a rational expression describing the word.作者: 橡子 時(shí)間: 2025-4-2 06:36
