標題: Titlebook: Descriptional Complexity of Formal Systems; 14th International W Martin Kutrib,Nelma Moreira,Rogério Reis Conference proceedings 2012 Sprin [打印本頁] 作者: 共用 時間: 2025-3-21 16:32
書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)
書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)學(xué)科排名
書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開度
書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Descriptional Complexity of Formal Systems被引頻次
書目名稱Descriptional Complexity of Formal Systems被引頻次學(xué)科排名
書目名稱Descriptional Complexity of Formal Systems年度引用
書目名稱Descriptional Complexity of Formal Systems年度引用學(xué)科排名
書目名稱Descriptional Complexity of Formal Systems讀者反饋
書目名稱Descriptional Complexity of Formal Systems讀者反饋學(xué)科排名
作者: 無目標 時間: 2025-3-21 22:59 作者: 同步左右 時間: 2025-3-22 01:39
Logical Analysis of Hybrid Systemselative to discrete systems. Moreover, there is a constructive reduction of properties of hybrid systems to corresponding properties of continuous systems or to corresponding properties of discrete systems. We briefly summarize and discuss some of the implications of these results.作者: 放棄 時間: 2025-3-22 07:01
Uniform Distributed Pushdown Automata Systemse under protocols and strategies similar to those in which cooperating distributed (CD) grammar systems work. Unlike the CD grammar systems case, where one may add or remove duplicate components without modifying the generated language, the identical components play an important role in distributed 作者: Presbycusis 時間: 2025-3-22 10:13
On Inverse Operations and Their Descriptional ComplexityKleene star operation for a language?. asks for the smallest language?. such that?.. is equal to?., if it exists [.. Roots of star events. J. ACM?14, 1967]. Other inverse operations based on the chop operation or on insertion/deletion operations can be defined appropriately. We present a general fra作者: critique 時間: 2025-3-22 13:34
Deciding Representability of Sets of Words of Equal Lengthwithout holes are simply words. Given a partial word ., we denote by sub.(.) the set of subwords of . of length ., i.e., words over the alphabet that are compatible with factors of . of length .. We call a set . of words .-representable if .?=?sub.(.) for some integer . and partial word . with . hol作者: critique 時間: 2025-3-22 17:56 作者: VOK 時間: 2025-3-22 22:22 作者: Grandstand 時間: 2025-3-23 03:14 作者: Legend 時間: 2025-3-23 06:52 作者: BABY 時間: 2025-3-23 10:02
State Complexity of Chop Operations on Unary and Finite Languagesuching letters merged if they are equal, otherwise their chop is undefined. The iterated variants chop-star and chop-plus are defined similar as the classical operations Kleene star and plus. We investigate the state complexity of chop operations on unary and/or finite languages, and obtain similar 作者: 是剝皮 時間: 2025-3-23 17:11 作者: perpetual 時間: 2025-3-23 18:06 作者: hedonic 時間: 2025-3-24 01:04 作者: 誹謗 時間: 2025-3-24 04:12
On Internal Contextual Grammars with Subregular Selection Languagesconsider families . which are obtained by restriction to . states or nonterminals or productions or symbols to accept or to generate regular languages, we obtain four infinite hierarchies of the corresponding families of languages generated by internal contextual grammars with selection languages in作者: 擔心 時間: 2025-3-24 06:49
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited P symbol and the current pushdown-store top. In this paper, we consider stateless pushdown automata whose size of their pushdown alphabet is limited by a positive integer. More specifically, we establish an infinite hierarchy of language families resulting from stateless pushdown automata with limite作者: GREEN 時間: 2025-3-24 12:51 作者: Neuralgia 時間: 2025-3-24 18:26
Minicomplexity, old theorems. We then record recent advances, both in the theory itself and in its relation to Turing machine complexity. Finally, we illustrate a proof technique, which we call .. The entire talk follows, extends, and advocates the Sakoda-Sipser framework.作者: Rustproof 時間: 2025-3-24 21:12
Logical Analysis of Hybrid Systemselative to discrete systems. Moreover, there is a constructive reduction of properties of hybrid systems to corresponding properties of continuous systems or to corresponding properties of discrete systems. We briefly summarize and discuss some of the implications of these results.作者: Frequency 時間: 2025-3-25 02:52
State Complexity of Star and Square of Union of , Regular Languagesmultiple combined operations and show that they are much lower than the mathematical compositions of the state complexities of their basic individual component operations, but have similar forms with the state complexities of some participating combined operations.作者: diskitis 時間: 2025-3-25 06:19 作者: OMIT 時間: 2025-3-25 09:08 作者: EXCEL 時間: 2025-3-25 14:59
Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata009, Balan claimed that also the converse holds. Here we show that Balan’s proof of this claim is not correct. Accordingly it is still open whether .-head pushdown automata and centralized PC systems of pushdown automata of degree . working in returning mode accept the same class of languages.作者: 表皮 時間: 2025-3-25 16:49 作者: TAIN 時間: 2025-3-25 22:47
Fifty Years of Women in MathematicsWe study the descriptional cost of converting . into equivalent deterministic devices. We show a double-exponential upper bound for this conversion, together with a super-exponential lower bound.作者: 哥哥噴涌而出 時間: 2025-3-26 03:17
Groups and Automata: A Perfect MatchWe present a personal perspective, inspired by our own research experience, of the interaction between group theory and automata theory: from Benois’ Theorem to Stallings’ automata, from hyperbolic to automatic groups, not forgetting the exotic automaton groups.作者: LAST 時間: 2025-3-26 05:53
Removing Nondeterminism in Constant Height Pushdown AutomataWe study the descriptional cost of converting . into equivalent deterministic devices. We show a double-exponential upper bound for this conversion, together with a super-exponential lower bound.作者: ANTH 時間: 2025-3-26 09:33
https://doi.org/10.1007/978-3-642-31623-4context-free languages; contextual grammars; nondeterminism; pushdown automata; state complexity作者: 教育學(xué) 時間: 2025-3-26 14:04 作者: BRAVE 時間: 2025-3-26 18:20
Fifty Years of Cytochrome P450 Researchly a finite coalgebraic representation of a regular closed .-coterm. One can give an operational semantics based on capsules for a higher-order programming language with functional and imperative features, including mutable bindings. Static (lexical) scoping is captured purely algebraically without 作者: Ointment 時間: 2025-3-26 21:32
Current Status of the Motive Concept, old theorems. We then record recent advances, both in the theory itself and in its relation to Turing machine complexity. Finally, we illustrate a proof technique, which we call .. The entire talk follows, extends, and advocates the Sakoda-Sipser framework.作者: 外來 時間: 2025-3-27 04:39
Current Status of the Motive Conceptelative to discrete systems. Moreover, there is a constructive reduction of properties of hybrid systems to corresponding properties of continuous systems or to corresponding properties of discrete systems. We briefly summarize and discuss some of the implications of these results.作者: 能夠支付 時間: 2025-3-27 05:56 作者: GOUGE 時間: 2025-3-27 12:40
This and That: My Times as , EditorKleene star operation for a language?. asks for the smallest language?. such that?.. is equal to?., if it exists [.. Roots of star events. J. ACM?14, 1967]. Other inverse operations based on the chop operation or on insertion/deletion operations can be defined appropriately. We present a general fra作者: 縱火 時間: 2025-3-27 16:43 作者: meditation 時間: 2025-3-27 18:34 作者: 發(fā)牢騷 時間: 2025-3-27 22:54
Fifty Years of X-Ray Diffractionence, there is all infinite sequences have an infinite number of non-random prefixes with respect to any given Blum Universal Static Complexity Space. This is a generalization of the result obtained by Solovay [27] and Calude [7] for plain complexity, and also of the result obtained by Campeanu [10]作者: 有罪 時間: 2025-3-28 04:58
Problems of Inorganic Structuresssary to generate the language. In particular, we consider the behaviour of this measure with respect to operations. For given natural numbers ..,..,…,.. and an .-ary operation . on languages, we discuss the set ..(..,..,…,..) which is the range of Prod(.(..,..,…, ..)) where, for 1?≤?.?≤?., .. is a 作者: Small-Intestine 時間: 2025-3-28 07:47
Fifty Years of X-Ray Diffractionmultiple combined operations and show that they are much lower than the mathematical compositions of the state complexities of their basic individual component operations, but have similar forms with the state complexities of some participating combined operations.作者: 夾死提手勢 時間: 2025-3-28 11:49
https://doi.org/10.1007/978-1-4615-9961-6uching letters merged if they are equal, otherwise their chop is undefined. The iterated variants chop-star and chop-plus are defined similar as the classical operations Kleene star and plus. We investigate the state complexity of chop operations on unary and/or finite languages, and obtain similar 作者: Nebulizer 時間: 2025-3-28 16:54
Santa Rosalia, the icon of biodiversity,nguages generated by 2-nonterminal grammars, which is in turn a proper subset of the family generated using 3 or more nonterminal symbols. This hierarchy is established by considering grammars over a one-letter alphabet, for which it is shown that 1-nonterminal grammars generate only regular languag作者: 譏笑 時間: 2025-3-28 20:38 作者: 善變 時間: 2025-3-29 00:57 作者: 音樂等 時間: 2025-3-29 03:55 作者: 字形刻痕 時間: 2025-3-29 10:36
Fighting Europe’s Unemployment in the 1990s symbol and the current pushdown-store top. In this paper, we consider stateless pushdown automata whose size of their pushdown alphabet is limited by a positive integer. More specifically, we establish an infinite hierarchy of language families resulting from stateless pushdown automata with limite作者: Essential 時間: 2025-3-29 11:57
Immigration and the European Labor Markets009, Balan claimed that also the converse holds. Here we show that Balan’s proof of this claim is not correct. Accordingly it is still open whether .-head pushdown automata and centralized PC systems of pushdown automata of degree . working in returning mode accept the same class of languages.作者: 過多 時間: 2025-3-29 18:56
Martin Kutrib,Nelma Moreira,Rogério ReisFast track conference proceedings.Unique visibility.State of the art research作者: 機制 時間: 2025-3-29 20:25 作者: 牢騷 時間: 2025-3-30 02:50
Descriptional Complexity of Formal Systems978-3-642-31623-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: SENT 時間: 2025-3-30 04:21 作者: 出汗 時間: 2025-3-30 08:48
Current Status of the Motive Conceptelative to discrete systems. Moreover, there is a constructive reduction of properties of hybrid systems to corresponding properties of continuous systems or to corresponding properties of discrete systems. We briefly summarize and discuss some of the implications of these results.作者: Slit-Lamp 時間: 2025-3-30 14:55
Fifty Years of X-Ray Diffractionmultiple combined operations and show that they are much lower than the mathematical compositions of the state complexities of their basic individual component operations, but have similar forms with the state complexities of some participating combined operations.作者: 驕傲 時間: 2025-3-30 17:48 作者: Nonporous 時間: 2025-3-30 22:01
Fighting Europe’s Unemployment in the 1990sconsider families . which are obtained by restriction to . states or nonterminals or productions or symbols to accept or to generate regular languages, we obtain four infinite hierarchies of the corresponding families of languages generated by internal contextual grammars with selection languages in ..作者: Disk199 時間: 2025-3-31 03:06 作者: 津貼 時間: 2025-3-31 05:51 作者: strain 時間: 2025-3-31 12:20
Randomness Behaviour in Blum Universal Static Complexity Spaces This is a generalization of the result obtained by Solovay [27] and Calude [7] for plain complexity, and also of the result obtained by Campeanu [10], and independently, later on, by Bienvenu and Downey in [1] for prefix-free complexity.作者: Chemotherapy 時間: 2025-3-31 17:05
Production Complexity of Some Operations on Context-Free Languages,.. and an .-ary operation . on languages, we discuss the set ..(..,..,…,..) which is the range of Prod(.(..,..,…, ..)) where, for 1?≤?.?≤?., .. is a context-free language with Prod(..)?=?... The operations under discussion are union, concatenation, reversal, and Kleene closure.作者: Mhc-Molecule 時間: 2025-3-31 18:03
Descriptional Complexity of Biautomatar studies the constructions of biautomata from the descriptional point of view. It proves that the tight bounds on the size of a biautomaton recognizing a regular language represented by a deterministic or nondeterministic automaton of . states, or by a syntactic monoid of size ., are .·2.???2(.???1), 2.???2(2.???1), and .., respectively.作者: 變形詞 時間: 2025-3-31 23:25
Fifty Years of Cytochrome P450 Researchstacks, heaps, or closures. All operations of interest are typable with simple types, yet the language is Turing complete. Recursive functions are represented directly as capsules without the need for fixpoint combinators.作者: Immobilize 時間: 2025-4-1 02:38 作者: 情愛 時間: 2025-4-1 08:34 作者: 諂媚于人 時間: 2025-4-1 13:23 作者: 北京人起源 時間: 2025-4-1 14:40
Phenotypic Variability of Fig (, L.)veral restricted variants of PDA are considered, leading to improved constructions. In all cases, we prove the asymptotical optimality of the size of the resulting NFA. Finally, we apply our results to decidability questions related to PDA, and obtain solutions in deterministic polynomial time.
