標題: Titlebook: Automata on Infinite Words; Ecole de Printemps d M. Nivat,D. Perrin Conference proceedings 1985 Springer-Verlag Berlin Heidelberg 1985 Fini [打印本頁] 作者: Cleveland 時間: 2025-3-21 18:14
書目名稱Automata on Infinite Words影響因子(影響力)
書目名稱Automata on Infinite Words影響因子(影響力)學科排名
書目名稱Automata on Infinite Words網(wǎng)絡(luò)公開度
書目名稱Automata on Infinite Words網(wǎng)絡(luò)公開度學科排名
書目名稱Automata on Infinite Words被引頻次
書目名稱Automata on Infinite Words被引頻次學科排名
書目名稱Automata on Infinite Words年度引用
書目名稱Automata on Infinite Words年度引用學科排名
書目名稱Automata on Infinite Words讀者反饋
書目名稱Automata on Infinite Words讀者反饋學科排名
作者: mortgage 時間: 2025-3-21 21:44
0302-9743 Overview: 978-3-540-15641-3978-3-540-39505-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: thwart 時間: 2025-3-22 03:58 作者: 難解 時間: 2025-3-22 05:59
https://doi.org/10.1007/978-3-531-90542-6er-free words. We present some conditions for some particular morphisms to be kth power-free. As a matter of fact we claim that the framework of the theory of codes is a good framework for these problems and we try to illustrate this.作者: fatty-streak 時間: 2025-3-22 09:40
,Theoretische überlegungen und Hypothesen,em can also be generated by an ε-free tag system. We give a full inclusion graph and several closure properties for the sets of infinite words considered. We investigate some extensions of tag systems using iterated sequential mappings.作者: BILE 時間: 2025-3-22 13:06
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166191.jpg作者: Hallowed 時間: 2025-3-22 18:16 作者: 損壞 時間: 2025-3-23 01:08 作者: 領(lǐng)先 時間: 2025-3-23 01:35 作者: 慎重 時間: 2025-3-23 06:46
https://doi.org/10.1007/978-3-531-90542-6ral topology are reviewed. It is observed that the spaces that arise as adherences of arbitrary languages may be characterized as either: (1) the closed subsets of the Cantor ternary set; (2) the zero-dimensional compact metrizable spaces; or (3) the Stone spaces of the countable Boolean algebras. R作者: Cholesterol 時間: 2025-3-23 12:40 作者: Flagging 時間: 2025-3-23 17:23
,Theoretische überlegungen und Hypothesen,em can also be generated by an ε-free tag system. We give a full inclusion graph and several closure properties for the sets of infinite words considered. We investigate some extensions of tag systems using iterated sequential mappings.作者: 強制性 時間: 2025-3-23 20:09
Deterministic asynchronous automata,hese, it is possible to reformulate the model in terms of partial functions between monoids from which we obtain an extension of the conventional sequential automaton. We conclude with some remarks on extensions to this work and its relationship to other theories of parallel systems.作者: Little 時間: 2025-3-23 22:58
Kth power-free codes,er-free words. We present some conditions for some particular morphisms to be kth power-free. As a matter of fact we claim that the framework of the theory of codes is a good framework for these problems and we try to illustrate this.作者: Intercept 時間: 2025-3-24 03:03
On various classes of infinite words obtained by iterated mappings,em can also be generated by an ε-free tag system. We give a full inclusion graph and several closure properties for the sets of infinite words considered. We investigate some extensions of tag systems using iterated sequential mappings.作者: 罐里有戒指 時間: 2025-3-24 07:14
https://doi.org/10.1007/3-540-15641-0Finite; Words; automata; decidability; equality; finite automata; form; formal proof; language; logic; mapping作者: 短程旅游 時間: 2025-3-24 14:00 作者: 不持續(xù)就爆 時間: 2025-3-24 18:37
https://doi.org/10.1007/978-3-531-90542-6We introduce yield of infinite trees. Trees are provided with usual syntactic order, words with a new order that canonically makes concatenation continuous. "Yield" operation is continuous. Our main result consists in the decidability of yield‘s equality for infinite regular trees.作者: Verify 時間: 2025-3-24 21:27
,Decidability of yield’s equality for infinite regular trees,We introduce yield of infinite trees. Trees are provided with usual syntactic order, words with a new order that canonically makes concatenation continuous. "Yield" operation is continuous. Our main result consists in the decidability of yield‘s equality for infinite regular trees.作者: abnegate 時間: 2025-3-25 00:12
An introduction to finite automata on infinite words,作者: Graduated 時間: 2025-3-25 04:48 作者: Organonitrile 時間: 2025-3-25 09:38
,Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme,作者: 行乞 時間: 2025-3-25 15:17
A formal proof system for infinitary rational expressions,作者: 火光在搖曳 時間: 2025-3-25 15:59 作者: 耐寒 時間: 2025-3-25 23:54 作者: EXUDE 時間: 2025-3-26 00:22 作者: 無能性 時間: 2025-3-26 05:48 作者: chemical-peel 時間: 2025-3-26 09:22 作者: 奇思怪想 時間: 2025-3-26 16:23 作者: 拔出 時間: 2025-3-26 19:33 作者: Malaise 時間: 2025-3-26 22:00 作者: 氣候 時間: 2025-3-27 04:47
Gesundheitsversorgung in Entwicklungsl?ndernrophedon sont exactement celles qui sont reconnues par les automates finis, sauf peut-être dans le cas des mots bi-infinis dont la lecture commence dans la partie finie..Nous donnons également des algorithmes pour décider de l‘équivalence de deux automates boustrophedon sur des mots finis ou infinis.作者: 攤位 時間: 2025-3-27 05:32
Gesundheitsvorsorge bei Kindernegular langages). In one case, the minimal star-height is the rank (in the sense of Eggan) of the minimal graph. There corresponds a caracterization of the star-height of a prefix-free regular langage w.r.t rational expressions of a special kind (called determinstic) as the rank of its minimal deterministic automaton considered as a graph.作者: ARCHE 時間: 2025-3-27 11:43
Automates boustrophedon sur des mots infinis,rophedon sont exactement celles qui sont reconnues par les automates finis, sauf peut-être dans le cas des mots bi-infinis dont la lecture commence dans la partie finie..Nous donnons également des algorithmes pour décider de l‘équivalence de deux automates boustrophedon sur des mots finis ou infinis.作者: 離開真充足 時間: 2025-3-27 14:35
The solution of two star-height problems for regular trees,egular langages). In one case, the minimal star-height is the rank (in the sense of Eggan) of the minimal graph. There corresponds a caracterization of the star-height of a prefix-free regular langage w.r.t rational expressions of a special kind (called determinstic) as the rank of its minimal deterministic automaton considered as a graph.作者: Enteropathic 時間: 2025-3-27 18:57 作者: hematuria 時間: 2025-3-28 00:03
The adherences of languages as topological spaces,anguage if and only if it is zero-dimensional compact metrizable and of finite type. The structural invariant of the adherence of a regular language is algorithmically constructiole from any automaton recognizing the language. Comparing these invariants provides a procedure for deciding homeomorphism of adherences for regular languages.作者: HPA533 時間: 2025-3-28 03:49
6樓作者: 認識 時間: 2025-3-28 07:45
6樓作者: 饒舌的人 時間: 2025-3-28 13:45
6樓作者: 諂媚于性 時間: 2025-3-28 16:58
6樓作者: Criteria 時間: 2025-3-28 21:56
7樓作者: Arctic 時間: 2025-3-29 02:14
7樓作者: 象形文字 時間: 2025-3-29 03:35
7樓作者: hardheaded 時間: 2025-3-29 09:44
7樓作者: 催眠藥 時間: 2025-3-29 13:18
8樓作者: 煩擾 時間: 2025-3-29 16:42
8樓作者: Directed 時間: 2025-3-29 21:33
8樓作者: 逗它小傻瓜 時間: 2025-3-30 02:31
9樓作者: 合同 時間: 2025-3-30 07:01
9樓作者: 分離 時間: 2025-3-30 09:12
9樓作者: tolerance 時間: 2025-3-30 12:47
9樓作者: 柔軟 時間: 2025-3-30 19:42
10樓作者: bibliophile 時間: 2025-3-30 22:57
10樓作者: Rct393 時間: 2025-3-31 01:21
10樓作者: Noisome 時間: 2025-3-31 07:48
10樓
