標(biāo)題: Titlebook: Developments in Language Theory; 20th International C Sre?ko Brlek,Christophe Reutenauer Conference proceedings 2016 Springer-Verlag Berlin [打印本頁(yè)] 作者: Assert 時(shí)間: 2025-3-21 16:11
書(shū)目名稱(chēng)Developments in Language Theory影響因子(影響力)
書(shū)目名稱(chēng)Developments in Language Theory影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Developments in Language Theory網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Developments in Language Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Developments in Language Theory被引頻次
書(shū)目名稱(chēng)Developments in Language Theory被引頻次學(xué)科排名
書(shū)目名稱(chēng)Developments in Language Theory年度引用
書(shū)目名稱(chēng)Developments in Language Theory年度引用學(xué)科排名
書(shū)目名稱(chēng)Developments in Language Theory讀者反饋
書(shū)目名稱(chēng)Developments in Language Theory讀者反饋學(xué)科排名
作者: 獨(dú)特性 時(shí)間: 2025-3-21 22:38
Cayley Automatic Groups and Numerical Characteristics of Turing Transducers,roduced by Kharlampovich, Khoussainov and Miasnikov. We address this problem by introducing three numerical characteristics of Turing transducers: growth functions, F?lner functions and average length growth functions. These three numerical characteristics are the analogs of growth functions, F?lner作者: 親愛(ài) 時(shí)間: 2025-3-22 03:10 作者: Choreography 時(shí)間: 2025-3-22 07:47
Position Automaton Construction for Regular Expressions with Intersection,ve based methods have recently been extended to regular expressions with intersection. In this paper, we present a position automaton construction for those expressions. This construction generalizes the notion of position making it compatible with intersection. The resulting automaton is homogeneou作者: Throttle 時(shí)間: 2025-3-22 11:05 作者: 轎車(chē) 時(shí)間: 2025-3-22 15:01
,-Abelian Equivalence and Rationality,same as for .. We study some combinatorial properties of .-abelian equivalence classes. Our starting point is a characterization of .-abelian equivalence by rewriting, so-called .-switching. We show that the set of lexicographically least representatives of equivalence classes is a regular language.作者: 轎車(chē) 時(shí)間: 2025-3-22 19:23
,Schützenberger Products in a Category,ger product to the level of monoids in an algebraic category ., leading to a uniform view of the corresponding constructions for monoids (Schützenberger), ordered monoids (Pin), idempotent semirings (Klíma and Polák), and algebras over a field (Reutenauer). In addition, assuming that . is part of a 作者: LAIR 時(shí)間: 2025-3-22 22:50 作者: 拱墻 時(shí)間: 2025-3-23 03:23
Both Ways Rational Functions,s are scanned in the same direction and a new one where they are scanned in different directions. The devices of the former type define the family of rational relations, while those of the latter define an a priori really different family. We characterize the partial functions that are in the inters作者: Palpitation 時(shí)間: 2025-3-23 06:09 作者: GRUEL 時(shí)間: 2025-3-23 11:10 作者: watertight, 時(shí)間: 2025-3-23 15:33
Degrees of Infinite Words, Polynomials and Atoms,rtance in a wide range of fields, from formal languages to pure mathematics and physics. While finite automata for recognising and transforming languages are well-understood, very little is known about the power of automata to transform infinite words..We use methods from linear algebra and analysis作者: Constrain 時(shí)間: 2025-3-23 20:38 作者: 辭職 時(shí)間: 2025-3-23 23:07
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space,ed initially. Under weak constructibility assumptions, not excluding monotone functions below ., we show: .?.. This extends, to sublogarithmic space, the classical simulation of alternating space by deterministic time. .?., a simulation with simultaneous bounds on time and space. This improves the k作者: 威脅你 時(shí)間: 2025-3-24 04:02 作者: LATE 時(shí)間: 2025-3-24 07:52
On Families of Full Trios Containing Counter Machine Languages,ng and decreasing phases is specified by some fixed “pattern”. We consider families of languages defined by various pattern behaviors and show that some correspond to the smallest full trios containing restricted classes of bounded semilinear languages. For example, one such family is exactly the sm作者: endoscopy 時(shí)間: 2025-3-24 12:15
Non-regular Maximal Prefix-Free Subsets of Regular Languages,ny non-regular MPFS..Next, we prove that if a regular language has any non-regular MPFS, then it also has a MPFS which is context-sensitive but not context-free, it has a MPFS which is recursive but not context-sensitive, and it has a MPFS which is not recursively enumerable..We show that no regular作者: MAIM 時(shí)間: 2025-3-24 18:25
Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata,new class called bounded-balance MPDAs. These MPDAs allow for infinitely deep nesting/nesting intersection, as long as the nesting depth differences within each scope stay within the balance bound. We compare our contributions to various related MPDAs and ambiguity detection methods.作者: Aerophagia 時(shí)間: 2025-3-24 19:49 作者: 佛刊 時(shí)間: 2025-3-25 02:32
Outfix-Guided Insertion, operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.作者: 思想上升 時(shí)間: 2025-3-25 04:06
Aperiodic String Transducers,. to copyless ., and (.) from .-bounded to 1-bounded .. We give the complexity of each construction and also prove that they preserve the aperiodicity of transducers. As corollaries, we obtain that . definable string-to-string functions are equivalent to . whose transition monoid is finite and aperiodic, and to aperiodic copyless ..作者: ACRID 時(shí)間: 2025-3-25 07:55
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space,nown inclusion, stating that .. .?., i.e., the alternating space is closed under complement. This simulation does not depend on whether .(.) is above . nor on whether the original machine gets into infinite loops, which solves a long-standing open problem.作者: AUGUR 時(shí)間: 2025-3-25 12:04 作者: APEX 時(shí)間: 2025-3-25 18:13 作者: 我們的面粉 時(shí)間: 2025-3-25 23:09
,-Abelian Equivalence and Rationality,nce by rewriting, so-called .-switching. We show that the set of lexicographically least representatives of equivalence classes is a regular language. From this we infer that the sequence of the numbers of equivalence classes is .-rational. We also show that the set of words defining .-abelian singleton classes is regular.作者: 偶像 時(shí)間: 2025-3-26 02:28
,Schützenberger Products in a Category,er), ordered monoids (Pin), idempotent semirings (Klíma and Polák), and algebras over a field (Reutenauer). In addition, assuming that . is part of a Stone-type duality, we derive a characterization of the languages recognized by Schützenberger products.作者: 擁擠前 時(shí)間: 2025-3-26 05:01
Both Ways Rational Functions,rational relations, while those of the latter define an a priori really different family. We characterize the partial functions that are in the intersection of the two families. We state a conjecture for the intersection for general, nonfunctional, relations.作者: 變形 時(shí)間: 2025-3-26 09:46
Degrees of Infinite Words, Polynomials and Atoms,ges are well-understood, very little is known about the power of automata to transform infinite words..We use methods from linear algebra and analysis to show that there is an infinite number of atoms in the transducer degrees, that is, minimal non-trivial degrees.作者: 艦旗 時(shí)間: 2025-3-26 12:49
Non-regular Maximal Prefix-Free Subsets of Regular Languages,ntext-free, it has a MPFS which is recursive but not context-sensitive, and it has a MPFS which is not recursively enumerable..We show that no regular language has a MPFS which is recursively enumerable but not recursive. Finally, for any regular language we can decide whether or not it has a context-free non-regular MPFS.作者: 誰(shuí)在削木頭 時(shí)間: 2025-3-26 20:02
https://doi.org/10.1007/978-3-662-66651-7new class called bounded-balance MPDAs. These MPDAs allow for infinitely deep nesting/nesting intersection, as long as the nesting depth differences within each scope stay within the balance bound. We compare our contributions to various related MPDAs and ambiguity detection methods.作者: 溝通 時(shí)間: 2025-3-26 22:18 作者: 弄皺 時(shí)間: 2025-3-27 04:13
https://doi.org/10.1007/978-3-658-09009-8 operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.作者: iodides 時(shí)間: 2025-3-27 05:57 作者: daredevil 時(shí)間: 2025-3-27 11:53 作者: Excitotoxin 時(shí)間: 2025-3-27 15:31
Conference proceedings 2016 efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimentional patterns; cryptography; concurrency; cellular automata; bio-inspried computing; quantum computing..作者: 墻壁 時(shí)間: 2025-3-27 19:48
0302-9743 ory, DLT 2016, held in Montreal, QC, Canada, in July 2016...The 32 full papers and 4 abstracts of invited papers presented were carefully reviewed and selected from 48 submissions. This volume presents current developments in formal languages and automata, especially from the following topics and ar作者: 牢騷 時(shí)間: 2025-3-27 23:40 作者: 文件夾 時(shí)間: 2025-3-28 05:44
https://doi.org/10.1007/978-3-662-63552-0his framework makes an essential use of languages of higher-dimensional words, called ., of arbitrary dimensions. It is shown here that the product thus introduced is associative over classes of languages closed under the product itself; this translates back to extra freedom in the way formulas and circuits can be decomposed.作者: minimal 時(shí)間: 2025-3-28 08:05 作者: 改良 時(shí)間: 2025-3-28 13:18
,L?sungen zu den übungsaufgaben,er), ordered monoids (Pin), idempotent semirings (Klíma and Polák), and algebras over a field (Reutenauer). In addition, assuming that . is part of a Stone-type duality, we derive a characterization of the languages recognized by Schützenberger products.作者: 運(yùn)動(dòng)吧 時(shí)間: 2025-3-28 17:38
https://doi.org/10.1007/978-3-658-09009-8rational relations, while those of the latter define an a priori really different family. We characterize the partial functions that are in the intersection of the two families. We state a conjecture for the intersection for general, nonfunctional, relations.作者: cumulative 時(shí)間: 2025-3-28 19:09 作者: 跳脫衣舞的人 時(shí)間: 2025-3-29 02:45 作者: Coordinate 時(shí)間: 2025-3-29 05:41
Conference proceedings 2016, in July 2016...The 32 full papers and 4 abstracts of invited papers presented were carefully reviewed and selected from 48 submissions. This volume presents current developments in formal languages and automata, especially from the following topics and areas: combinatorial and algebraic properties作者: 裂縫 時(shí)間: 2025-3-29 09:18 作者: APO 時(shí)間: 2025-3-29 12:08
On Families of Full Trios Containing Counter Machine Languages,guages. Still another is the smallest full trio containing all bounded languages whose Parikh map is a semilinear set where all periodic vectors have at most two non-zero coordinates. We also examine relationships between the families.作者: outset 時(shí)間: 2025-3-29 17:45
0302-9743 gic; picture description and analysis; polyominoes and bidimentional patterns; cryptography; concurrency; cellular automata; bio-inspried computing; quantum computing..978-3-662-53131-0978-3-662-53132-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Mingle 時(shí)間: 2025-3-29 21:08 作者: 縮減了 時(shí)間: 2025-3-30 01:01 作者: certitude 時(shí)間: 2025-3-30 06:58
Sre?ko Brlek,Christophe ReutenauerIncludes supplementary material: 作者: set598 時(shí)間: 2025-3-30 09:48 作者: HATCH 時(shí)間: 2025-3-30 12:22
https://doi.org/10.1007/978-3-662-66651-7We prove the closure under complementation of the class of languages of scattered and countable N-free posets recognized by branching automata. The proof relies entirely on effective constructions.作者: 完整 時(shí)間: 2025-3-30 18:30 作者: Pericarditis 時(shí)間: 2025-3-30 21:18
Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets,We prove the closure under complementation of the class of languages of scattered and countable N-free posets recognized by branching automata. The proof relies entirely on effective constructions.作者: 劇毒 時(shí)間: 2025-3-31 01:37 作者: 兒童 時(shí)間: 2025-3-31 07:01
Developments in Language Theory978-3-662-53132-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 誰(shuí)在削木頭 時(shí)間: 2025-3-31 12:43 作者: 迅速成長(zhǎng) 時(shí)間: 2025-3-31 16:42
https://doi.org/10.1007/978-3-8348-9687-2several papers since 2008. We prove that the maximal density of wildcards in the ternary infinite square-free partial word is surprisingly big: 3/16. In addition, we introduce a related characteristic of infinite square-free words, called flexibility, and find its values for some interesting words and classes of words.作者: 清晰 時(shí)間: 2025-3-31 20:42
Potenzreihenans?tze und Anwendungen, and symbolic automata. By defining two particular data storages, we show that this combination is rich enough to capture symbolic visibly pushdown automata and weighted timed automata. We introduce a weighted MSO-logic and prove a Büchi-Elgot-Trakhtenbrot theorem, i.e., the new logic and the new automaton model are expressively equivalent.作者: 輕而薄 時(shí)間: 2025-4-1 00:22 作者: 走調(diào) 時(shí)間: 2025-4-1 02:28 作者: Admire 時(shí)間: 2025-4-1 09:56 作者: anaphylaxis 時(shí)間: 2025-4-1 12:42 作者: 與野獸博斗者 時(shí)間: 2025-4-1 17:57
https://doi.org/10.1007/978-3-662-63552-0nguage-theoretical setting? We address that question, and in doing so, introduce a product directly on languages that parallels formula composition. This framework makes an essential use of languages of higher-dimensional words, called ., of arbitrary dimensions. It is shown here that the product th作者: circuit 時(shí)間: 2025-4-1 19:04 作者: Kinetic 時(shí)間: 2025-4-1 22:54 作者: 動(dòng)物 時(shí)間: 2025-4-2 06:03
