標(biāo)題: Titlebook: Language and Automata Theory and Applications; 5th International Co Adrian-Horia Dediu,Shunsuke Inenaga,Carlos Martín- Conference proceedin [打印本頁] 作者: 一個(gè)希拉里 時(shí)間: 2025-3-21 19:50
書目名稱Language and Automata Theory and Applications影響因子(影響力)
書目名稱Language and Automata Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Language and Automata Theory and Applications被引頻次
書目名稱Language and Automata Theory and Applications被引頻次學(xué)科排名
書目名稱Language and Automata Theory and Applications年度引用
書目名稱Language and Automata Theory and Applications年度引用學(xué)科排名
書目名稱Language and Automata Theory and Applications讀者反饋
書目名稱Language and Automata Theory and Applications讀者反饋學(xué)科排名
作者: GREG 時(shí)間: 2025-3-21 23:31 作者: tendinitis 時(shí)間: 2025-3-22 02:12
https://doi.org/10.1007/978-3-642-21254-3AI logics; Petri nets; computational linguistics; formal languages; grammar systems; parsing; program sema作者: artless 時(shí)間: 2025-3-22 08:37 作者: Sedative 時(shí)間: 2025-3-22 10:41 作者: FATAL 時(shí)間: 2025-3-22 15:14
Automatic Structures and GroupsAutomata theory has unified many areas of computer science and mathematics. These include group theory (Thurston automatic groups [11], branch and self similar groups [1] [24]), computable model theory (the theory of automatic structures [5] [17] [16]), finite model theory, algorithms and decidability, logic, model checking and verification.作者: Agility 時(shí)間: 2025-3-22 17:46
Abstract Numeration SystemsWe survey various results concerning abstract numeration systems. We begin with the classical case of the integer base numeration systems, then examine the more general case of linear numeration systems. Finally we discuss abstract numeration systems, which generalize even further the two previous classes of numeration systems.作者: Little 時(shí)間: 2025-3-22 23:32
Rule Formats for DistributivityThis paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats.作者: 消息靈通 時(shí)間: 2025-3-23 03:00
Finite Orbits of Language OperationsWe consider a set of natural operations on languages, and prove that the orbit of any language . under the monoid generated by this set is finite and bounded, independently of .. This generalizes previous results about complement, Kleene closure, and positive closure.作者: conjunctiva 時(shí)間: 2025-3-23 09:10 作者: animated 時(shí)間: 2025-3-23 13:07
Recognizing Shuffled Languagesan recognition, and natural language processing. We study the complexity of the membership problem for such models, i.e., how difficult it is to determine if a string belongs to a language or not. In particular, we investigate how interleaving can be introduced into models that capture the context-free languages.作者: HEDGE 時(shí)間: 2025-3-23 15:04 作者: Coordinate 時(shí)間: 2025-3-23 21:47 作者: 喚起 時(shí)間: 2025-3-24 02:15
Mutation Systemsutomaton simulation shows that in this framework, universal computation is possible and the question of whether one string can evolve into another is undecidable. We also analyze the efficiency of the finite state machine simulation assuming random point mutations.作者: adulterant 時(shí)間: 2025-3-24 04:24 作者: drusen 時(shí)間: 2025-3-24 06:38 作者: aphasia 時(shí)間: 2025-3-24 11:37
A Simple and Efficient Universal Reversible Turing Machineersibilizing any existing universal machine. The interpretive overhead of the URTM is limited to a (program dependent) constant factor slowdown, with no other complexity-wise cost . time and space. The URTM is also able to function as an . for RTMs at no asymptotic cost, simply by reversing the string representing the interpreted machine.作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-3-24 17:25
Unary Pattern Avoidance in Partial Words Dense with Holesles. We define the concept of hole sparsity, a measure of the frequency of holes in a partial word, and determine the minimum hole sparsity for all unary patterns in the context of trivial and non-trivial avoidability.作者: 外面 時(shí)間: 2025-3-24 21:23 作者: Melodrama 時(shí)間: 2025-3-25 02:00
The Complexity of Request-Response Gamesmes played on DAGs, and .-complete or .-complete if there is only one player (depending on whether he wants to enforce or spoil the request-response condition)..We also present near-optimal bounds on the memory needed to design winning strategies for each player, in each case.作者: 修改 時(shí)間: 2025-3-25 05:41
0302-9743 ogic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition.978-3-642-21253-6978-3-642-21254-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 一大群 時(shí)間: 2025-3-25 07:48 作者: 反話 時(shí)間: 2025-3-25 13:49 作者: 信條 時(shí)間: 2025-3-25 17:13
Partial Derivatives of an Extended Regular Expressionthis paper, we generalize Antimirov partial derivatives to regular expressions extended to complementation and intersection. For a simple regular expression with . symbols, Antimirov automaton has at most .?+?1 states. As far as an extended regular expression is concerned, we show that the number of states can be exponential.作者: 凝乳 時(shí)間: 2025-3-25 20:04
Conference proceedings 2011Among the topics covered are algebraic language theory, automata and logic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition.作者: 起皺紋 時(shí)間: 2025-3-26 02:20
0302-9743 l Conference on Language and Automata Theory and Applications, LATA 2011, held in Tarragona, Spain in May 2011. The 36 revised full papers presented together with four invited articles were carefully selected from 91 submissions. Among the topics covered are algebraic language theory, automata and l作者: BALK 時(shí)間: 2025-3-26 06:51
Narad Rampersadhomogeneous (Lie) groups. The place where Hardy inequalities and homogeneous groups meet is a beautiful area of mathematics with links to many other subjects. While describing the general theory of Hardy, Rellich, Caffarelli-Kohn-Nirenberg, Sobolev, and other inequalities in the setting of general h作者: Aerophagia 時(shí)間: 2025-3-26 09:38
Luca Aceto,Matteo Cimini,Anna Ingolfsdottir,Mohammad Reza Mousavi,Michel A. Reniershomogeneous (Lie) groups. The place where Hardy inequalities and homogeneous groups meet is a beautiful area of mathematics with links to many other subjects. While describing the general theory of Hardy, Rellich, Caffarelli-Kohn-Nirenberg, Sobolev, and other inequalities in the setting of general h作者: 同來核對(duì) 時(shí)間: 2025-3-26 15:42
Dana Angluin,James Aspnes,Raonne Barbosa Vargasnly of considerable intrinsic interest but have for many years proved to be indispensible in the study of partial differential equations and variational problems. Many developments of the basic theory since its inception arise in response to concrete problems, for example, with the (ubiquitous) sets作者: PUT 時(shí)間: 2025-3-26 19:38 作者: forecast 時(shí)間: 2025-3-26 22:37
Holger Bock Axelsen,Robert Glückular quasi-metric spaces. The text is divided into two main parts, with the first part providing atomic, molecular, and grand maximal function characterizations of Hardy spaces and formulates sharp versions of basic analytical tools for quasi-metric spaces, such as a Lebesgue differentiation theorem作者: 香料 時(shí)間: 2025-3-27 02:48 作者: Aids209 時(shí)間: 2025-3-27 05:48 作者: 遣返回國(guó) 時(shí)間: 2025-3-27 12:52 作者: 小口啜飲 時(shí)間: 2025-3-27 16:33 作者: 供過于求 時(shí)間: 2025-3-27 21:15 作者: effrontery 時(shí)間: 2025-3-27 23:53
John Case,Sanjay Jain,Trong Dao Le,Yuh Shin Ong,Pavel Semukhin,Frank Stephan scales, this book establishes new conditions that lead to sThe book is devoted to dynamic inequalities of Hardy type and extensions?and generalizations via convexity on a time scale T. In particular,?the book contains the time scale versions of classical Hardy type inequalities,?Hardy and Littlewoo作者: Inordinate 時(shí)間: 2025-3-28 02:42
émilie Charlier,Mike Domaratzki,Tero Harju,Jeffrey Shallit scales, this book establishes new conditions that lead to sThe book is devoted to dynamic inequalities of Hardy type and extensions?and generalizations via convexity on a time scale T. In particular,?the book contains the time scale versions of classical Hardy type inequalities,?Hardy and Littlewoo作者: 膠水 時(shí)間: 2025-3-28 06:49
Krishnendu Chatterjee,Nathana?l Fijalkown and Macmillan to publish his first novel forced him to turn to the less prestigious William Tinsley for his second. Tinsley, sole proprietor of the family firm after the death of his more businesslike brother in 1866, did not move in the same social circles or belong to the same literary establish作者: 護(hù)身符 時(shí)間: 2025-3-28 13:59
Krishnendu Chatterjee,Thomas A. Henzinger,Florian Horne middle of Hardy’s fictional career’, when he might have been expected to produce his best work, but instead wrote many of the novels which have come to be regarded as mediocre (Gatrell 1986a: 70–1). I have included . in this category partly because it was so spectacularly unsuccessful at the time,作者: majestic 時(shí)間: 2025-3-28 17:13 作者: cluster 時(shí)間: 2025-3-28 19:00 作者: 閑蕩 時(shí)間: 2025-3-28 23:47 作者: Muffle 時(shí)間: 2025-3-29 06:32
Vector Addition System Reachability Problem: A Short Self-contained Proofthms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition (KLMTS decomposition). Recently from this decomposition, we deduced that a final configuration is not reachable from an initial one if and only if there exists a Presburger inductive invariant that contains 作者: 堅(jiān)毅 時(shí)間: 2025-3-29 10:18
Mutation Systems system is whether knowing the rules for mutations and fitness, we can predict whether it is possible for one string to evolve into another. To explore this issue we define a specific kind of mutation system with point mutations and a fitness function based on conserved strongly .-testable string pa作者: 恃強(qiáng)凌弱的人 時(shí)間: 2025-3-29 13:57 作者: FLEET 時(shí)間: 2025-3-29 17:48 作者: 商議 時(shí)間: 2025-3-29 21:05 作者: milligram 時(shí)間: 2025-3-30 02:34 作者: 指數(shù) 時(shí)間: 2025-3-30 06:13 作者: figment 時(shí)間: 2025-3-30 10:25 作者: observatory 時(shí)間: 2025-3-30 14:52 作者: HUSH 時(shí)間: 2025-3-30 19:48
Automatic Learning of Subclasses of Pattern Languagesy, given an index for the language. For alphabet size of at least 4, every automatic class of erasing pattern languages is contained, for some constant ., in the class of all languages generated by patterns which contain (1) every variable only once and (2) at most . symbols after the first occurren作者: 愛管閑事 時(shí)間: 2025-3-30 23:17 作者: Relinquish 時(shí)間: 2025-3-31 01:48 作者: PANIC 時(shí)間: 2025-3-31 07:48 作者: hemoglobin 時(shí)間: 2025-3-31 11:00
Vector Addition System Reachability Problem: A Short Self-contained Prooff actions and a second one that tries to prove the non-reachability by enumerating Presburger formulas. In this paper we provide the first proof of the VAS reachability problem that is not based on the KLMST decomposition. The proof is based on the notion of production relations, inspired from Hausc作者: corpus-callosum 時(shí)間: 2025-3-31 16:17
Finitary Languagesmata. We (a)?show that the finitary languages are Σ..-complete; (b)?present a complete picture of the expressive power of various classes of automata with finitary and infinitary acceptance conditions; (c)?show that the languages defined by finitary parity automata exactly characterize the star-free作者: BALK 時(shí)間: 2025-3-31 21:05 作者: BLOT 時(shí)間: 2025-4-1 00:22 作者: ureter 時(shí)間: 2025-4-1 03:38
