標(biāo)題: Titlebook: Language and Automata Theory and Applications; 13th International C Carlos Martín-Vide,Alexander Okhotin,Dana Shapira Conference proceeding [打印本頁(yè)] 作者: abandon 時(shí)間: 2025-3-21 18:51
書目名稱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é)科排名
作者: 仔細(xì)閱讀 時(shí)間: 2025-3-21 22:19
Markus Holzer,Michal Hospodárthe Springer Lecture Notes on Harmonic Analysis on Totally D- connected Sets) when he was 31. By that time he had already published on the subjects of Tauberian algebras, in the theory of generalized functions,978-0-8176-4504-5Series ISSN 2296-5009 Series E-ISSN 2296-5017 作者: 幻想 時(shí)間: 2025-3-22 00:43 作者: Fibrillation 時(shí)間: 2025-3-22 04:54 作者: 芳香一點(diǎn) 時(shí)間: 2025-3-22 09:19
Alberto Dennunzio,Enrico Formenti,Luca Manzoni,Luciano Margara,Antonio E. Porreca作者: mucous-membrane 時(shí)間: 2025-3-22 14:25 作者: Nefarious 時(shí)間: 2025-3-22 20:21
An Oracle Hierarchy for Small One-Way Finite Automata to our oracle-automaton, under which the oracle hierarchy is proved to coincide with the alternating one, thus providing an oracle-based characterization for it. We also show that, given all others, each of these restrictions is necessary for this characterization.作者: THROB 時(shí)間: 2025-3-22 22:15 作者: Panther 時(shí)間: 2025-3-23 04:11 作者: parsimony 時(shí)間: 2025-3-23 08:14 作者: 帶來(lái)的感覺(jué) 時(shí)間: 2025-3-23 10:49
Vladimir A. Zakharove is needed for their characterization of sketchability. We resolve this question by proving that for arbitrarily large ., there is an .-point metric space (.(.), ..) which is .(1)-sketchable yet for every ., if . and ..?:?.(.)?→?.. are such that . for all ., .?∈?.(.), then necessarily lim..(.)?=?..作者: 我不明白 時(shí)間: 2025-3-23 17:12 作者: 欄桿 時(shí)間: 2025-3-23 19:13 作者: Coterminous 時(shí)間: 2025-3-24 00:51
Orbits of Abelian Automaton Groupsumber field lead to a polynomial-time algorithm for deciding when the orbits of a transduction are a rational relation. These algorithms were implemented in the SageMath computer algebra system and are available online?[.].作者: 把手 時(shí)間: 2025-3-24 03:15
Automata over Infinite Sequences of Realsg other things, several closure properties of the languages accepted, a real number analogue of McNaughton’s theorem, and give a metafinite logic characterizing the infinite languages acceptable by non-deterministic Büchi automata over ..作者: Palate 時(shí)間: 2025-3-24 09:38 作者: 入會(huì) 時(shí)間: 2025-3-24 12:39
0302-9743 2019, held in St. Petersburg, Russia, in March 2019...The 31 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 98 submissions. The papers cover the following topics: Automata; Complexity; Grammars; Languages; Graphs, trees and rewriting; and Words 作者: 脫水 時(shí)間: 2025-3-24 15:21
Conference proceedings 2019 in St. Petersburg, Russia, in March 2019...The 31 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 98 submissions. The papers cover the following topics: Automata; Complexity; Grammars; Languages; Graphs, trees and rewriting; and Words and codes.作者: 護(hù)身符 時(shí)間: 2025-3-24 20:21
Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata case .. We also prove that linear HOCA over . of memory size . are indistinguishable from a subclass of LCA over .. This enables to decide injectivity and surjectivity for linear HOCA over . of memory size . by means of the decidable characterizations of injectivity and surjectivity provided in?[.] and?[.] for LCA over ..作者: Mawkish 時(shí)間: 2025-3-25 00:39
On Varieties of Ordered Automataof this correspondence. These bring certain well-known results from a new perspective and also some new observations. Moreover, complexity aspects of the membership problem are discussed both in the particular examples and in a general setting.作者: 多節(jié) 時(shí)間: 2025-3-25 04:41
Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automataucers. Due to this translation we obtain a simple procedure for checking equivalence of 2-DFSAs in polynomial time. We believe that the further development of this approach could bring us to an efficient equivalence checking algorithm for deterministic multi-tape automata with an arbitrary number of tapes.作者: 天空 時(shí)間: 2025-3-25 07:29 作者: ingrate 時(shí)間: 2025-3-25 12:39 作者: Delectable 時(shí)間: 2025-3-25 19:17 作者: Pericarditis 時(shí)間: 2025-3-25 20:28
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/581020.jpg作者: 到婚嫁年齡 時(shí)間: 2025-3-26 03:49
978-3-030-13434-1Springer Nature Switzerland AG 2019作者: JIBE 時(shí)間: 2025-3-26 05:11
Language and Automata Theory and Applications978-3-030-13435-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: irradicable 時(shí)間: 2025-3-26 09:37
From Words to Graphs, and Backe discovery of the Prüfer code for trees, the interplay between words and graphs has repeatedly been explored and exploited in both directions. In the present paper, we review some of the many results in this area and discuss a number of open problems related to this topic.作者: Favorable 時(shí)間: 2025-3-26 16:09 作者: subordinate 時(shí)間: 2025-3-26 17:55
Modern Aspects of Complexity Within Formal LanguagesWe give a survey on some recent developments and achievements of modern complexity-theoretic investigations of questions in Formal Languages (FL). We will put a certain focus on multivariate complexity analysis, because this seems to be particularly suited for questions concerning typical questions in FL.作者: white-matter 時(shí)間: 2025-3-26 22:18 作者: 爭(zhēng)吵加 時(shí)間: 2025-3-27 01:29 作者: 槍支 時(shí)間: 2025-3-27 08:36
Observation and Interactionwerful than observation. Observation is the use of input data plus, possibly, tractable computation, in such a way that the observer has no effect on the source of the data. Interaction is observation plus action that affects the source of the data. Observation lets the data “speak for itself” and i作者: THROB 時(shí)間: 2025-3-27 10:23 作者: Vital-Signs 時(shí)間: 2025-3-27 13:51 作者: 保全 時(shí)間: 2025-3-27 19:19
Orbits of Abelian Automaton Groupsdki?[.], we describe a useful embedding of abelian automaton groups into a corresponding algebraic number field, and give a polynomial time algorithm to compute this embedding. We apply this technique to study iteration of transductions in abelian automaton groups. Specifically, properties of this n作者: 烤架 時(shí)間: 2025-3-28 01:40
Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automatat time . only depends on the state at time ., while in HOCA it is a function of the states at time ., ..., ., where . is the memory size. In particular, we provide easy-to-check necessary and sufficient conditions for a linear HOCA over . of memory size . to be sensitive to the initial conditions or作者: FLIC 時(shí)間: 2025-3-28 05:31
On Varieties of Ordered Automatace have been found with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand. It is also possible to consider classes of automata instead of algebraic structures as a natural counterpart of classes of languages. Here we deal with th作者: NOT 時(shí)間: 2025-3-28 09:44
Automata over Infinite Sequences of Realseal numbers. The present paper continues the study of (a variant) of this model dealing with computations on infinite strings of reals. Our results support the view that this is a suitable model of finite automata over the real numbers. We define Büchi and Muller versions of the model and show, amon作者: 細(xì)查 時(shí)間: 2025-3-28 11:49
Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computa. 275–286] were concerned with nonuniform families of finite automata and they discussed the behaviors of nonuniform complexity classes defined by families of such finite automata having polynomial-size state complexity. In a similar fashion, we introduce nonuniform state complexity classes using fa作者: nonplus 時(shí)間: 2025-3-28 18:18
Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata ambiguous, bounded valued, of bounded length degree) this problem has effective solutions which, however, require significant computational costs. In this paper we distinguish a new class of transducers (we call them prefix-free since their transitions are characterized by this property of language作者: 疏忽 時(shí)間: 2025-3-28 20:42 作者: Lice692 時(shí)間: 2025-3-29 00:21
Closure and Nonclosure Properties of the Compressible and Rankable Setsced the formal study of polynomial-time ranking. Yet even after all that time, whether the rankable and compressible sets are closed under the most important boolean and other operations remains essentially unexplored. The present paper studies these questions for both polynomial-time and recursion-作者: Corral 時(shí)間: 2025-3-29 03:31 作者: Ingratiate 時(shí)間: 2025-3-29 07:28
State Complexity of Pseudocatenationxity of a regularity-preserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation, where the two operands range over all languages of state complexities . and ., respectively. We consider the deterministic and nondeterministic state compl作者: 構(gòu)成 時(shí)間: 2025-3-29 14:36 作者: intangibility 時(shí)間: 2025-3-29 18:11 作者: 神圣不可 時(shí)間: 2025-3-29 20:03
Ilya Zakirzyanov,Antonio Morgado,Alexey Ignatiev,Vladimir Ulyantsev,Joao Marques-Silvat that was October of 1999, and already more than six years have passed. But John is still too young to be fully honored by a single foreword,or even a singlevolume,thatattemptstosummarizetheimpactofhisworkonharmonic analysis, his students, and his coworkers.Given his continuing high (and even incre作者: 虛弱 時(shí)間: 2025-3-30 01:24 作者: 到婚嫁年齡 時(shí)間: 2025-3-30 07:43
Jackson Abascal,Lane A. Hemaspaandra,Shir Maimon,Daniel Rubery theory, time-frequency analysis, and sampling theory..ContrThis volume is dedicated to John Benedetto. It seems just yesterday that we celebrated his 60th birthday in a memorable conference in College Park. Yet that was October of 1999, and already more than six years have passed. But John is still作者: inhibit 時(shí)間: 2025-3-30 09:02
Markus Holzer,Michal Hospodár theory, time-frequency analysis, and sampling theory..ContrThis volume is dedicated to John Benedetto. It seems just yesterday that we celebrated his 60th birthday in a memorable conference in College Park. Yet that was October of 1999, and already more than six years have passed. But John is still作者: boisterous 時(shí)間: 2025-3-30 14:49 作者: BILL 時(shí)間: 2025-3-30 19:53
Stephen Fenner,Daniel Padé theory, time-frequency analysis, and sampling theory..ContrThis volume is dedicated to John Benedetto. It seems just yesterday that we celebrated his 60th birthday in a memorable conference in College Park. Yet that was October of 1999, and already more than six years have passed. But John is still作者: CUB 時(shí)間: 2025-3-30 22:22
10樓作者: Emg827 時(shí)間: 2025-3-31 04:54
10樓作者: anniversary 時(shí)間: 2025-3-31 05:25
10樓作者: 鍵琴 時(shí)間: 2025-3-31 10:46
10樓
