標(biāo)題: Titlebook: Automata, Languages and Programming; Fourth Colloquium, U Arto Salomaa,Magnus Steinby Conference proceedings 1977 Springer-Verlag Berlin He [打印本頁] 作者: angiotensin-I 時(shí)間: 2025-3-21 18:28
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學(xué)科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: Militia 時(shí)間: 2025-3-21 21:41 作者: 摘要 時(shí)間: 2025-3-22 02:46 作者: 極大的痛苦 時(shí)間: 2025-3-22 07:04
Parsing and syntactic error recovery for context-free grammars by means of coarse structures,its main applications: we showed that two-level parsing by means of coarse structures can simplify the parsing process and that the concept of coarse structures can advantageously be used for syntax error recovery using global rather than local context of the error position.作者: Vasodilation 時(shí)間: 2025-3-22 10:17 作者: 花爭(zhēng)吵 時(shí)間: 2025-3-22 14:56
,On the time and tape complexity of hyper(1)-AFL’s,)-AFL, too. Thus we study the family of block-indexed languages. We show that this family is a hyper(1)-AFL which is not a hyper-AFL and that it is contained in the family of languages log(n)-tape reducible to the context-free languages. This implies that the family of block-indexed languages, toget作者: 排出 時(shí)間: 2025-3-22 20:34
Renaming and erasing in szilard languages,e. a language generated by such grammar) then L -{λ} is a coding (renaming) of some Szilard language. This result shows that arbitrary homomorphisms do not have more generating power than nonerasing ones except that they generate the empty word. Combining this result with other properties of label l作者: 贊成你 時(shí)間: 2025-3-22 22:32 作者: Esophagus 時(shí)間: 2025-3-23 03:59
Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata,作者: 爆米花 時(shí)間: 2025-3-23 07:32 作者: Hyperplasia 時(shí)間: 2025-3-23 13:46
Serial composition of 2-way finite-state transducers and simple programs on strings,作者: 無底 時(shí)間: 2025-3-23 15:08 作者: Slit-Lamp 時(shí)間: 2025-3-23 21:02 作者: GUILE 時(shí)間: 2025-3-24 02:09 作者: 災(zāi)難 時(shí)間: 2025-3-24 04:12 作者: epicardium 時(shí)間: 2025-3-24 09:01
https://doi.org/10.1007/b138054(n)..We investigate lower and upper bounding functions for the right-contextsensitivity functions of contextsensitive grammars and languages and study the families of context-sensitive languages with right-contextsensitivity functions bounded by some particular sublinear functions f.作者: Thyroid-Gland 時(shí)間: 2025-3-24 11:39
https://doi.org/10.1007/978-3-540-73410-9e expressions and equations..Since one might interprete label grammars as a special kind of labelled Petri nets, where each transition has exactly one input arc, we solved the elemination problem of λ-transitions for this restricted class of Petri nets, even if there occur infinite firing-sequences using only λ-transitions within a net.作者: 集合 時(shí)間: 2025-3-24 15:40
The contextsensitivity bounds of contextsensitive grammars and languages,(n)..We investigate lower and upper bounding functions for the right-contextsensitivity functions of contextsensitive grammars and languages and study the families of context-sensitive languages with right-contextsensitivity functions bounded by some particular sublinear functions f.作者: inscribe 時(shí)間: 2025-3-24 21:53
Renaming and erasing in szilard languages,e expressions and equations..Since one might interprete label grammars as a special kind of labelled Petri nets, where each transition has exactly one input arc, we solved the elemination problem of λ-transitions for this restricted class of Petri nets, even if there occur infinite firing-sequences using only λ-transitions within a net.作者: 過剩 時(shí)間: 2025-3-25 02:31 作者: 積習(xí)難改 時(shí)間: 2025-3-25 06:22 作者: 外面 時(shí)間: 2025-3-25 10:55
,On the time and tape complexity of hyper(1)-AFL’s,ntained in the family of languages log(n)-tape reducible to the context-free languages. This implies that the family of block-indexed languages, together with the smallest hyper(1)-AFL, has a tractable membership question and tape complexity log.(n). Finally we note that the set {ww / wε {a, b}*} is not a block-indexed language.作者: 自戀 時(shí)間: 2025-3-25 14:14
Herausforderungen an das Gesundheitswesen, In the present paper, for any N and r, an infinite, decidable subdomain . [N,r] .. [N,r] is defined in a constructive way. The ensuing sufficient condition for the termination of a computation starting from N X. ... X. can be tested in a number of steps negligible with respect to those needed for reaching the n.f., if there is one.作者: Inoperable 時(shí)間: 2025-3-25 16:03 作者: 歡樂中國(guó) 時(shí)間: 2025-3-25 23:47 作者: 搖曳 時(shí)間: 2025-3-26 00:16
,Optimale Vergütung von Leistungserbringern,unique starth root — called the factor graph of Q. The Knuth, Morris, Pratt pattern-matching algorithm, its extensions and Weiner‘s substring identifier algorithm are all shown to correspond to finding the factor graph of some regular language.作者: Admire 時(shí)間: 2025-3-26 07:19
https://doi.org/10.1007/978-3-540-73410-9its main applications: we showed that two-level parsing by means of coarse structures can simplify the parsing process and that the concept of coarse structures can advantageously be used for syntax error recovery using global rather than local context of the error position.作者: 音樂等 時(shí)間: 2025-3-26 09:42 作者: 丑惡 時(shí)間: 2025-3-26 13:01
,Optimale Vergütung von Leistungserbringern,unique starth root — called the factor graph of Q. The Knuth, Morris, Pratt pattern-matching algorithm, its extensions and Weiner‘s substring identifier algorithm are all shown to correspond to finding the factor graph of some regular language.作者: cumber 時(shí)間: 2025-3-26 17:17 作者: COKE 時(shí)間: 2025-3-27 00:49
https://doi.org/10.1007/b138054xtsensitivity of a grammar is defined on its derivations, and it is determined by the maximal length of the strings of ancestors of any symbol occurring at any position of the derived strings. A total recursive function f bounds the (right-) contextsensitivity function of grammar G, if for every ter作者: plasma-cells 時(shí)間: 2025-3-27 03:54
https://doi.org/10.1007/978-3-540-73410-9its main applications: we showed that two-level parsing by means of coarse structures can simplify the parsing process and that the concept of coarse structures can advantageously be used for syntax error recovery using global rather than local context of the error position.作者: jagged 時(shí)間: 2025-3-27 06:48
https://doi.org/10.1007/978-3-540-73410-9ethods recently introduced in graph theory. A class of pattern matching and replacement rules for graphs is specified, such that applications of rules in the class can readily be programmed as rapid transformations of record structures. When transformations of record structures are formalized as app作者: Mhc-Molecule 時(shí)間: 2025-3-27 09:59 作者: BOLUS 時(shí)間: 2025-3-27 14:17 作者: Phagocytes 時(shí)間: 2025-3-27 18:40 作者: Foam-Cells 時(shí)間: 2025-3-28 00:42
Parsing and syntactic error recovery for context-free grammars by means of coarse structures,its main applications: we showed that two-level parsing by means of coarse structures can simplify the parsing process and that the concept of coarse structures can advantageously be used for syntax error recovery using global rather than local context of the error position.作者: Aggregate 時(shí)間: 2025-3-28 05:53
https://doi.org/10.1007/3-540-08342-1Automatentheorie; Languages; Semiotik; automata; calculus; complexity; data structures; optimization; progra作者: FECK 時(shí)間: 2025-3-28 08:06 作者: pantomime 時(shí)間: 2025-3-28 11:36
https://doi.org/10.1007/978-3-540-73410-9The sequence equivalence problem for DOL systems is shown to be decidable. In an algebraic formulation the sequence equivalence problem for DOL systems can be stated as follows: Given homomorphisms h. and h. on a free monoid Σ* and a word σ from Σ*, is h.(σ)=h.(σ) for all n>0?作者: 火花 時(shí)間: 2025-3-28 14:57 作者: 愚笨 時(shí)間: 2025-3-28 21:23
6樓作者: patriarch 時(shí)間: 2025-3-28 23:44
6樓作者: 天賦 時(shí)間: 2025-3-29 06:48
6樓作者: 有抱負(fù)者 時(shí)間: 2025-3-29 08:33
7樓作者: 溫順 時(shí)間: 2025-3-29 11:47
7樓作者: 相信 時(shí)間: 2025-3-29 15:48
7樓作者: 披肩 時(shí)間: 2025-3-29 22:41
7樓作者: 越自我 時(shí)間: 2025-3-30 03:30
8樓作者: 我不明白 時(shí)間: 2025-3-30 04:51
8樓作者: cocoon 時(shí)間: 2025-3-30 11:14
8樓作者: 撫慰 時(shí)間: 2025-3-30 16:27
9樓作者: dilute 時(shí)間: 2025-3-30 20:11
9樓作者: 諂媚于人 時(shí)間: 2025-3-30 23:46
9樓作者: Germinate 時(shí)間: 2025-3-31 02:39
9樓作者: immunity 時(shí)間: 2025-3-31 06:57
10樓作者: Pathogen 時(shí)間: 2025-3-31 11:33
10樓作者: 釘牢 時(shí)間: 2025-3-31 16:12
10樓作者: 朋黨派系 時(shí)間: 2025-3-31 17:37
10樓
