Vendeur : Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Royaume-Uni
Etat : Good. Light overall wear with inscription to inner front cover, some sellotape repairs to hinges, otherwise good, clean and unmarked, throughout. N° de réf. du vendeur 088245-1
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 5907668-n
Quantité disponible : 15 disponible(s)
Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
Paperback or Softback. Etat : New. Mathematical Foundations of Computer Science 1974: 3rd Symposium at Jadwisin Near Warsaw, June 17 - 22, 1974. Book. N° de réf. du vendeur BBS-9783540071624
Quantité disponible : 5 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 5907668
Quantité disponible : 15 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540071624
Quantité disponible : 10 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 5907668-n
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 5907668
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 1975 edition. 486 pages. 9.40x6.40x1.00 inches. In Stock. N° de réf. du vendeur x-3540071628
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Sequential functions and generalized Moore and Mealy automata.- Mathematical methods of the theory of stochastic automata.- On the quasi-controllability of automata.- Models for analysis of races in sequential networks.- Factorizations, congruences, and the. N° de réf. du vendeur 458659009
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Neuware - InhaltsangabeSequential functions and generalized Moore and Mealy automata.- Mathematical methods of the theory of stochastic automata.- On the quasi-controllability of automata.- Models for analysis of races in sequential networks.- Factorizations, congruences, and the decomposition of automata and systems.- On the periodic sum and extensions of finite automata.- Finite branching automata: automata theory motivated by problem solving.- On configurations in cellular automata.- Finite automata acceptation of infinite sequences.- R-fuzzy automata with a time-variant structure.- Functions computable in the limit by probabilistic machines.- Some properties of limit recursive functions.- On some approximation problems of continuous computation.- Set-theoretic properties of programs in stored program computers.- Classification of programs of a SPC.- The algebraic approach to the theory of computing systems.- Continuous simple Z-machines, Z-computable functions and sets of functions of n real variables.- An approach to correctness proofs of semicoroutines.- Towards an understanding of complex processes.- Simulation.- Concurrent programs.- Ultralinear expressions.- A family of algebraic systems related to the theory of equations on free monoids.- Stretching by probabilistic tree automata and Santos grammars.- Top down versus bottom up syntax analysis revised.- Substring languages.- Defining languages by Mazurkiewicz aigorithms.- Complexity and normal forms of context-free languages.- The axiomatization problem of a theory of linear languages.- A lattice-theoretical approach to problem-solving.- On the equivalence of planar grammars and parallel picture processing algorithms.- Combinatorial aspects of information storage and retrieval.- Modular approach to the logical theory of programs.- Proving programs by sets of computations.- Bases of paths in correctness proofs.- Algebraic models I.- Structured programmability of iterative algorithms.- On equivalence of programs.- Mathematical model of programs with dynamic allocation of variables.- Mathematical foundations of motivation languages and synthesis maps.- The semantics of semantic equations.- + -valued algorithmic logic as a tool to investigate procedures.- Call-by-value versus call-by-name: A proof-theoretic comparison.- Procedures, formal computations and models. N° de réf. du vendeur 9783540071624
Quantité disponible : 2 disponible(s)