Titlebook: Automata on Infinite Words; Ecole de Printemps d M. Nivat,D. Perrin Conference proceedings 1985 Springer-Verlag Berlin Heidelberg 1985 Fini

Cleveland

书目名称Automata on Infinite Words影响因子(影响力)




书目名称Automata on Infinite Words影响因子(影响力)学科排名




书目名称Automata on Infinite Words网络公开度




书目名称Automata on Infinite Words网络公开度学科排名




书目名称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

0302-9743 Overview: 978-3-540-15641-3978-3-540-39505-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

thwart

难解

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

,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

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166191.jpg

Hallowed

损坏

领先

慎重

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