標(biāo)題: Titlebook: Language and Automata Theory and Applications; Third International Adrian Horia Dediu,Armand Mihai Ionescu,Carlos Mar Conference proceedin [打印本頁] 作者: Clique 時(shí)間: 2025-3-21 17:27
書目名稱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é)科排名
作者: Vaginismus 時(shí)間: 2025-3-21 21:03 作者: fulcrum 時(shí)間: 2025-3-22 00:27
State Complexity of Nested Word Automataestablish a lower bound for the state complexity of Kleene star that is of a different order than the known tight state complexity bound for the star of ordinary regular languages. We survey known bounds on deterministic and nondeterministic state complexity of basic operations on regular nested word languages and discuss open problems.作者: 系列 時(shí)間: 2025-3-22 06:04
Refinement and Consistency of Timed Modal Specificationsefine ., an automata-based formalism combining modal and timed aspects. As a stepping stone to compositional approaches of timed systems, we define the notions of refinement and consistency, and establish their decidability.作者: 征兵 時(shí)間: 2025-3-22 09:29
How Many Holes Can an Unbordered Partial Word Contain?d is called . if one of its proper prefixes is compatible with one of its suffixes (here . is compatible with every letter in the alphabet); it is called . otherwise. In this paper, we investigate the problem of computing the maximum number of holes a partial word of a fixed length can have and still fail to be bordered.作者: SUGAR 時(shí)間: 2025-3-22 15:35
Conference proceedings 2009 in Tarragona, Spain, in April 2009. The 58 revised full papers presented together with 3 invited lectures and two tutorials were carefully reviewed and selected from 121 submissions. The papers address all the various issues related to automata theory and formal languages.作者: NAVEN 時(shí)間: 2025-3-22 20:50
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical ApplicationsThis tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-width and clique-width. It will review applications to the construction of algorithms, to Graph Theory and to the extension to graphs of Formal Language Theory concepts.作者: peak-flow 時(shí)間: 2025-3-23 00:39 作者: CLAN 時(shí)間: 2025-3-23 02:17
Language and Automata Theory and Applications978-3-642-00982-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Cytology 時(shí)間: 2025-3-23 05:49 作者: 猜忌 時(shí)間: 2025-3-23 13:43 作者: 爵士樂 時(shí)間: 2025-3-23 16:38 作者: 不朽中國 時(shí)間: 2025-3-23 18:15 作者: ERUPT 時(shí)間: 2025-3-24 01:00 作者: 梯田 時(shí)間: 2025-3-24 05:46
Picture Languages Generated by Assembling Tiles finite set of rules, called a . (TRuSsystem). We prove that the TRuSsystems have a greater generative capacity than the tiling systems of Giammarresi and Restivo, even in the case of one-letter alphabet picture languages. This is due mainly to the use of the notion of replacement.作者: RENAL 時(shí)間: 2025-3-24 10:25
0302-9743 reviewed and selected from 121 submissions. The papers address all the various issues related to automata theory and formal languages.978-3-642-00981-5978-3-642-00982-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: LUDE 時(shí)間: 2025-3-24 13:46 作者: 愉快嗎 時(shí)間: 2025-3-24 16:56
Recent Developments in Algorithmic Teaching should become harder when the memory size of the learners decreases; teaching should become easier if the learners provide feedback; and it should be possible to teach infinite concepts and/or finite and infinite concept classes..Recent developments in the algorithmic teaching achieving (some) of these aspects are presented and compared.作者: Increment 時(shí)間: 2025-3-24 20:42
Descriptional and Computational Complexity of Finite Automata, e.g., fixed and general membership, emptiness, universality, equivalence, and related problems, and?(iii) minimization and approximation. We thus come across descriptional and computational complexity issues of finite automata. We do not prove these results but we merely draw attention to the big picture and some of the main ideas involved.作者: 沒收 時(shí)間: 2025-3-25 00:31 作者: Console 時(shí)間: 2025-3-25 06:55 作者: Anhydrous 時(shí)間: 2025-3-25 10:02 作者: fatty-acids 時(shí)間: 2025-3-25 12:01 作者: Neuralgia 時(shí)間: 2025-3-25 17:22
0302-9743 2009, held in Tarragona, Spain, in April 2009. The 58 revised full papers presented together with 3 invited lectures and two tutorials were carefully reviewed and selected from 121 submissions. The papers address all the various issues related to automata theory and formal languages.978-3-642-00981-作者: 惡意 時(shí)間: 2025-3-25 21:28
Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theoryions of .-copies of a more manageable class. So we formulate “l(fā)earning time” of a class and then study in general setting how much “l(fā)earning time” is increased by the elementwise union, by using Ramsey number. We also point out that such a standpoint can be generalized by using Noetherian spaces.作者: 晚間 時(shí)間: 2025-3-26 01:15 作者: CRANK 時(shí)間: 2025-3-26 05:37
Descriptional and Computational Complexity of Finite Automatarmously valuable concept has been developed. In the present paper, we tour a fragment of this literature. Mostly, we discuss developments relevant to finite automata related problems like, for example,?(i) simulation of and by several types of finite automata,?(ii) standard automata problems such as作者: Juvenile 時(shí)間: 2025-3-26 10:21
Hypothesis Spaces for Learning also discuss results which consider how learnability is effected if one requires learning with respect to every suitable hypothesis space. Additionally, optimal hypothesis spaces, using which every learnable class is learnable, is considered.作者: Kidney-Failure 時(shí)間: 2025-3-26 12:50
State Complexity of Nested Word Automataestablish a lower bound for the state complexity of Kleene star that is of a different order than the known tight state complexity bound for the star of ordinary regular languages. We survey known bounds on deterministic and nondeterministic state complexity of basic operations on regular nested wor作者: 使閉塞 時(shí)間: 2025-3-26 20:14 作者: 尾巴 時(shí)間: 2025-3-26 21:39 作者: Fortify 時(shí)間: 2025-3-27 03:05 作者: 誰在削木頭 時(shí)間: 2025-3-27 05:59
Matching Trace Patterns with Regular Policies to describe situations that are problematic, and thus should be avoided. Given a trace pattern ., i.e., a sequence of action symbols and variables, were the variables stand for unknown (i.e., not observed) sequences of actions, we ask whether . potentially violates a given policy ., i.e., whether t作者: Aviary 時(shí)間: 2025-3-27 10:40
Absolute Convergence of Rational Series Is Semi-decidablelutely convergent rational series . can be computed by a multiplicity automaton . which has the property that .. is simply convergent, where .. is the series computed by the automaton |.| derived from . by taking the absolute values of all its parameters. Then, we prove that the set . composed of al作者: Narrative 時(shí)間: 2025-3-27 14:06 作者: ungainly 時(shí)間: 2025-3-27 19:32 作者: 橡子 時(shí)間: 2025-3-28 00:06
Nondeterministic Instance Complexity and Proof Systems with Adviceof systems with advice. In this paper we investigate the following question: ... Depending on the complexity of the underlying language . and the amount and type of the advice used by the proof system, we obtain different characterizations for this problem. In particular, we show that the above ques作者: Rodent 時(shí)間: 2025-3-28 02:36 作者: JEER 時(shí)間: 2025-3-28 07:53
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithmstial word contained in . with the property that no two holes are within distance .. Our algorithm runs in .(.) time and is used for the study of freeness of partial words. Furthermore, we construct an infinite word over a five-letter alphabet that is overlap-free even after the insertion of an arbit作者: Generator 時(shí)間: 2025-3-28 12:14 作者: Addictive 時(shí)間: 2025-3-28 16:21
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Only recently it has been shown that the OBDD complexity of the most significant bit of integer multiplication is exponential, answering an open question posed by Wegener (2000). In this paper a larg作者: 圖畫文字 時(shí)間: 2025-3-28 20:48 作者: Rinne-Test 時(shí)間: 2025-3-29 02:15
ever, come into existence? Few of us believe that we can wrong those whom we leave out of existence altogether—that is, merely possible persons. We may think as well that the directive to be “fruitful, and multiply, and replenish the earth” 1 does not hold up to close scrutiny. How can it be wrong t作者: majestic 時(shí)間: 2025-3-29 06:24 作者: Ingest 時(shí)間: 2025-3-29 08:23
Bruno Courcelleever, come into existence? Few of us believe that we can wrong those whom we leave out of existence altogether—that is, merely possible persons. We may think as well that the directive to be “fruitful, and multiply, and replenish the earth” 1 does not hold up to close scrutiny. How can it be wrong t作者: 大看臺(tái) 時(shí)間: 2025-3-29 12:31 作者: Protein 時(shí)間: 2025-3-29 19:16 作者: RLS898 時(shí)間: 2025-3-29 21:17 作者: 舊石器時(shí)代 時(shí)間: 2025-3-30 00:15
Frank J. Balbach,Thomas Zeugmannrsons are triggered well before the point at which those persons commence their existence. We think it would be wrong, for example, to choose today to turn the Earth of the future into a miserable place even if978-94-007-2604-8978-1-4020-5697-0Series ISSN 1567-8008 Series E-ISSN 2351-955X 作者: Loathe 時(shí)間: 2025-3-30 07:11
Parosh Aziz Abdulla,Giorgio Delzanno,Laurent Van Begin作者: 誓言 時(shí)間: 2025-3-30 12:02
Nathalie Bertrand,Sophie Pinchinat,Jean-Baptiste Raclet作者: Dictation 時(shí)間: 2025-3-30 16:19 作者: 含糊 時(shí)間: 2025-3-30 18:26 作者: recession 時(shí)間: 2025-3-30 23:26
Paola Bonizzoni,Claudio Ferretti,Anthonath Roslin Sagaya Mary,Giancarlo Mauri作者: evanescent 時(shí)間: 2025-3-31 03:44
substantially better. We may think as well that our obligations with respect to future persons are triggered well before the point at which those persons commence their existence. We think it would be wrong, for example, to choose today to turn the Earth of the future into a miserable place even if作者: 勾引 時(shí)間: 2025-3-31 06:54 作者: Assault 時(shí)間: 2025-3-31 12:02 作者: 決定性 時(shí)間: 2025-3-31 15:17 作者: Functional 時(shí)間: 2025-3-31 17:36 作者: reception 時(shí)間: 2025-3-31 23:07 作者: installment 時(shí)間: 2025-4-1 04:55
