Mathematical Foundations of Computer Science 1984 : 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings. 1st ed. 1984

種類:

電子ブック

責任表示:

edited by M.P. Chytil, V. Koubek

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1984

著者名:

• Chytil, M.P.
• Koubek, V.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 176

ISBN:

9783540389293 [3540389296]    

注記:

Separating, strongly separating, and collapsing relativized complexity classes -- Complexity of quantifier elimination in the theory of algebraically closed fields -- Systolic automata — power, characterizations, nonhomogeneity -- A note on unique decipherability -- Outline of an algebraic language theory -- Thue systems and the Church-Rosser property -- Limits, higher type computability and type-free languages -- Traces, histories, graphs: Instances of a process monoid -- Recent results on automata and infinite words -- VLSI algorithms and architectures -- Decidability of monadic theories -- On the Ehrenfeucht conjecture on test sets and its dual version -- Sparse oracles, lowness, and highness -- Computability of probabilistic parameters for some classes of formal languages -- A truely morphic characterization of recursively enumerable sets -- On the Herbrand Kleene universe for nondeterministic computations -- An investigation of controls for concurrent systems by abstract control languages -- On generaliz

ローカル注記:

学内専用E-BOOKS (local access only)