Titlebook: Automata, Languages, and Programming; Sixth Colloquium, Gr Hermann A. Maurer Conference proceedings 1979 Springer-Verlag Berlin Heidelberg

斷頭臺(tái)

書目名稱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é)科排名

Ordnance

,Sur les mots sans carré définis par un morphisme,cacbabcbac is nonrepetitive. There is no nonrepetitive word of length 4 over a two letter alphabet ; on the contrary, there exist infinite nonrepetitive words over a three letter alphabet. Most of the explicitly known infinite nonrepetitive words are constructed by iteration of a morphism. In this p

Aerophagia

Existential quantifiers in abstract data types,ions and conjunctions of equations. Necessary and sufficient conditions for the existence of terminal algebras are investigated. Furthermore, some advantages of disjunctions and existential quantifiers within the laws are discussed and the usefulness of terminal algebras is demonstrated by a few exa

Permanent

–scent

Arbitration and queueing under limited shared storage requirements,-valued shared buffer. The algorithm uses a generalized test-and-set instruction, and schedules processes into their critical sections on a first-come, first-serve basis. The method can be extended to accomodate any queueing discipline defined as a function of the system history between consecutive

職業(yè)

Stagger

Proving termination with multiset orderings,proach is to find a . that maps the values of the program variables into some well-founded set, such that the value of the termination function is continually reduced throughout the computation. All too often, the termination functions required are difficult to find and are of a complexity out of pr

平

香料

Hectic

Strict deterministic languages and controlled rewriting systems, is injective); in some sense, θ generalizes the semi-Dyck simplification. We state :.THEOREM 2 : ". R ... X* . θ(R)". This extends a result of M. Benois [1], also obtained by M. Fliess [10] (using quite different methods)..THEOREM 3 : ". L . A .. . θ(L) ..".This is a reformulation of a result recen