標(biāo)題: Titlebook: Automata, Languages and Programming; 14th International C Thomas Ottmann Conference proceedings 1987 Springer-Verlag Berlin Heidelberg 1987 [打印本頁(yè)] 作者: GURU 時(shí)間: 2025-3-21 19:03
書(shū)目名稱Automata, Languages and Programming影響因子(影響力)
書(shū)目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書(shū)目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Automata, Languages and Programming被引頻次
書(shū)目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書(shū)目名稱Automata, Languages and Programming年度引用
書(shū)目名稱Automata, Languages and Programming年度引用學(xué)科排名
書(shū)目名稱Automata, Languages and Programming讀者反饋
書(shū)目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: Cholagogue 時(shí)間: 2025-3-22 00:17
On the Knuth-Bendix completion for concurrent processes,e condition is fullfilled. This condition is always satisfied in the purely free or purely commutative case of semi-Thue systems or vector-replacement systems. In fact, it generalizes (and unifies) both cases.作者: arcane 時(shí)間: 2025-3-22 04:21
0302-9743 ssociation for Theoretical Computer Science (EATCS) and held in Karlsruhe, July 13-17, 1987. The papers report on original research in theoretical computer science and cover topics such as algorithms and data structures, automata and formal languages, computability and complexity theory, semantics o作者: Generalize 時(shí)間: 2025-3-22 06:52 作者: Kidney-Failure 時(shí)間: 2025-3-22 12:04 作者: 蚊子 時(shí)間: 2025-3-22 15:11 作者: 合適 時(shí)間: 2025-3-22 17:53 作者: 共同時(shí)代 時(shí)間: 2025-3-22 23:02
,?konomische Bedeutung von Bildung,he second characterization is more combinatorial in nature. The decidability follows from the third — algebraic — characterization. The last and somewhat unexpected characterization is a topological description of our languages that solves an open problem about the finite-group topology of the free monoid.作者: Fretful 時(shí)間: 2025-3-23 02:40 作者: etiquette 時(shí)間: 2025-3-23 05:44
Non-uniform automata over groups,and extend this theory to NUDFA‘s over solvable groups (NUDFA‘s over non-solvable groups have the maximum possible computing power [Ba86]). We characterize the power of NUDFA‘s over nilpotent groups and prove some optimal lower bounds for NUDFA‘s over certain groups which are solvable but not nilpotent.作者: 幾何學(xué)家 時(shí)間: 2025-3-23 13:08 作者: 性冷淡 時(shí)間: 2025-3-23 14:52
Conference proceedings 1987 for Theoretical Computer Science (EATCS) and held in Karlsruhe, July 13-17, 1987. The papers report on original research in theoretical computer science and cover topics such as algorithms and data structures, automata and formal languages, computability and complexity theory, semantics of programm作者: 表兩個(gè) 時(shí)間: 2025-3-23 21:08 作者: EXPEL 時(shí)間: 2025-3-24 01:57 作者: 攤位 時(shí)間: 2025-3-24 04:45 作者: 樂(lè)器演奏者 時(shí)間: 2025-3-24 09:42 作者: Lethargic 時(shí)間: 2025-3-24 10:48 作者: 花束 時(shí)間: 2025-3-24 16:54 作者: HPA533 時(shí)間: 2025-3-24 21:51
Der Kampf um das Mitbestimmungsrechtd work..The proof of completeness, which is an interesting subject by itself, employs a new proof technique which utilizes a notion of transfinite semantic trees designed for proving refutational completeness of theorem proving methods in general..The outline of the paper is as follows: Section 1 br作者: 使出神 時(shí)間: 2025-3-25 00:58 作者: 值得尊敬 時(shí)間: 2025-3-25 06:18 作者: Aviary 時(shí)間: 2025-3-25 08:24 作者: Mediocre 時(shí)間: 2025-3-25 12:58 作者: 小卒 時(shí)間: 2025-3-25 16:14
Automata, Languages and Programming978-3-540-47747-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: intoxicate 時(shí)間: 2025-3-25 22:44 作者: orthopedist 時(shí)間: 2025-3-26 02:52
Gewerblicher Rechtsschutz und Urheberrechterse image of a Scott open set under the continuous function which the program denotes. Inverse image analysis is one possible way of extending strictness analysis to languages with lazy data structures and could perhaps be used to optimise code in implementations of such languages.作者: 發(fā)起 時(shí)間: 2025-3-26 07:12
Gewerkschaften im Umbau des Sozialstaats an extension of the standard unification algorithm invented by Martelli and Montanari [16]. It is demand driven and can handle infinite and partial instantiated objects and thus can be used as a means to integrate functional and logic programming.作者: 討厭 時(shí)間: 2025-3-26 08:59 作者: STAT 時(shí)間: 2025-3-26 13:11
Wirtschaftswissenschaftliche Beitr?ge if w ε A* contains all letters of A then [w*]={u ε A* | u ～ w. for some n ≥ 0} is a rational set iff the graph of the complement . of θ is connected. We prove: 1) if θ is not connected then [w*] has starheight one, 2) if θ and . are connected there exist words w ε A* such that [w*] is a rational set of arbitrary starheight.作者: capillaries 時(shí)間: 2025-3-26 19:11
Gewerblicher Rechtsschutz und Urheberrechtic programming framework. To this end, we generalize the notion of an ion introduced in [7], and develop our alternative to the language and metalanguage amalgamation approach suggested by Bowen and Kowalski [1].作者: GNAT 時(shí)間: 2025-3-26 21:09
Gewerblicher Rechtsschutz und Urheberrechterse image of a Scott open set under the continuous function which the program denotes. Inverse image analysis is one possible way of extending strictness analysis to languages with lazy data structures and could perhaps be used to optimise code in implementations of such languages.作者: conscribe 時(shí)間: 2025-3-27 04:24 作者: 拘留 時(shí)間: 2025-3-27 05:41
Gewerkschaften im Umbau des Sozialstaats procedure to concurrent processes. We will see that there are systems which have no finite set of critical pairs, even if the system consists of one rule only. Therefore we develop a sufficient (and computable) condition such that finite replacement systems have a finite set of critical pairs if th作者: Banquet 時(shí)間: 2025-3-27 09:42
Der Kampf um das Mitbestimmungsrechtl if it generates equations which cannot be oriented into rules (i.e., the system is not .), or if it generates infinitely many rules (i.e., the system is not .). In 1981 Huet showed that even if the system is not confluent, the Knuth-Bendix procedure still yields a semi-decision procedure for word 作者: 委派 時(shí)間: 2025-3-27 15:37 作者: 很是迷惑 時(shí)間: 2025-3-27 18:03 作者: COLIC 時(shí)間: 2025-3-27 22:38
https://doi.org/10.1007/978-3-322-83378-5 theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform .. [Ba86], NUDFA characterizations of several important subclasses of .. [BT87], and a new proof [BT87] of the old作者: 太空 時(shí)間: 2025-3-28 04:25
https://doi.org/10.1007/978-3-662-11876-4ing sense : in every state q, there exists a transition beginning in q and a transition ending in q; furthermore every state is an initial and a final state..We prove here that every rational cover is recognized by a minimal deterministic trimmed automaton Q in the sense of Eilenberg [4] : if . is a作者: 為寵愛(ài) 時(shí)間: 2025-3-28 07:31
Wirtschaftswissenschaftliche Beitr?ge if w ε A* contains all letters of A then [w*]={u ε A* | u ～ w. for some n ≥ 0} is a rational set iff the graph of the complement . of θ is connected. We prove: 1) if θ is not connected then [w*] has starheight one, 2) if θ and . are connected there exist words w ε A* such that [w*] is a rational se作者: Cholagogue 時(shí)間: 2025-3-28 12:57
,?konomische Bedeutung von Bildung, may yield more than one output for some inputs, an inconvenience in some applications. In principle, multiple output values can be treated in one of the following ways: (1) Consider any input leading to multiple outputs in error. (2) Select the shortest output and consider the input in error if tie作者: fulmination 時(shí)間: 2025-3-28 15:37
,?konomische Bedeutung von Bildung,tself. We give four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states and we show that one can effectively decide whether a given rational (or regular) language can be accepted by a reversible automaton. The first charac作者: 相符 時(shí)間: 2025-3-28 20:01
Logic programming with ions,ic programming framework. To this end, we generalize the notion of an ion introduced in [7], and develop our alternative to the language and metalanguage amalgamation approach suggested by Bowen and Kowalski [1].作者: restrain 時(shí)間: 2025-3-29 01:07 作者: 成績(jī)上升 時(shí)間: 2025-3-29 03:59 作者: crescendo 時(shí)間: 2025-3-29 09:33 作者: GLUE 時(shí)間: 2025-3-29 14:28
A star-height problem in free monoids with partial commutations, if w ε A* contains all letters of A then [w*]={u ε A* | u ～ w. for some n ≥ 0} is a rational set iff the graph of the complement . of θ is connected. We prove: 1) if θ is not connected then [w*] has starheight one, 2) if θ and . are connected there exist words w ε A* such that [w*] is a rational set of arbitrary starheight.作者: 輕彈 時(shí)間: 2025-3-29 15:43 作者: Euthyroid 時(shí)間: 2025-3-29 23:18
978-3-540-18088-3Springer-Verlag Berlin Heidelberg 1987作者: cortex 時(shí)間: 2025-3-30 00:52 作者: 休閑 時(shí)間: 2025-3-30 07:41 作者: 制定法律 時(shí)間: 2025-3-30 12:15 作者: 容易生皺紋 時(shí)間: 2025-3-30 13:48 作者: GLARE 時(shí)間: 2025-3-30 17:46
Logic programming with ions,ic programming framework. To this end, we generalize the notion of an ion introduced in [7], and develop our alternative to the language and metalanguage amalgamation approach suggested by Bowen and Kowalski [1].作者: 遠(yuǎn)地點(diǎn) 時(shí)間: 2025-3-31 00:18
Inverse image analysis,erse image of a Scott open set under the continuous function which the program denotes. Inverse image analysis is one possible way of extending strictness analysis to languages with lazy data structures and could perhaps be used to optimise code in implementations of such languages.作者: Priapism 時(shí)間: 2025-3-31 00:52
A unification algorithm for confluent theories, an extension of the standard unification algorithm invented by Martelli and Montanari [16]. It is demand driven and can handle infinite and partial instantiated objects and thus can be used as a means to integrate functional and logic programming.作者: 體貼 時(shí)間: 2025-3-31 05:48 作者: Coronary-Spasm 時(shí)間: 2025-3-31 11:05
On word problems in equational theories,l if it generates equations which cannot be oriented into rules (i.e., the system is not .), or if it generates infinitely many rules (i.e., the system is not .). In 1981 Huet showed that even if the system is not confluent, the Knuth-Bendix procedure still yields a semi-decision procedure for word 作者: 范例 時(shí)間: 2025-3-31 16:25
Another look at abstraction in process algebra, In this paper, we look at abstraction in the framework of the Algebra of Communicating Processes (see BERGSTRA & KLOP [4, 6]). We introduce a hidden step η, and construct a model for the resulting theory ACP.. We briefly look at recursive specifications in this theory, and discuss the relations wit作者: 惡意 時(shí)間: 2025-3-31 18:42 作者: 無(wú)能力 時(shí)間: 2025-4-1 01:25
Non-uniform automata over groups, theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform .. [Ba86], NUDFA characterizations of several important subclasses of .. [BT87], and a new proof [BT87] of the old作者: ALIAS 時(shí)間: 2025-4-1 03:05
Minimal automaton of a rational cover,ing sense : in every state q, there exists a transition beginning in q and a transition ending in q; furthermore every state is an initial and a final state..We prove here that every rational cover is recognized by a minimal deterministic trimmed automaton Q in the sense of Eilenberg [4] : if . is a作者: Sad570 時(shí)間: 2025-4-1 06:47
A star-height problem in free monoids with partial commutations, if w ε A* contains all letters of A then [w*]={u ε A* | u ～ w. for some n ≥ 0} is a rational set iff the graph of the complement . of θ is connected. We prove: 1) if θ is not connected then [w*] has starheight one, 2) if θ and . are connected there exist words w ε A* such that [w*] is a rational se作者: vitrectomy 時(shí)間: 2025-4-1 11:16 作者: Libido 時(shí)間: 2025-4-1 15:21
On the languages accepted by finite reversible automata,tself. We give four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states and we show that one can effectively decide whether a given rational (or regular) language can be accepted by a reversible automaton. The first charac作者: 我沒(méi)有命令 時(shí)間: 2025-4-1 20:35
The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of?Real-World Networks978-81-322-1792-3作者: Host142 時(shí)間: 2025-4-2 01:36 作者: 預(yù)示 時(shí)間: 2025-4-2 05:18
