Mathematical Foundations of Computer Science 1984: 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings (Lecture Notes in Computer Science, 176)
ISBN 10: 3540133720 ISBN 13: 9783540133728
Edité par Springer, 1984
Neuf(s)
Couverture souple
Vendeur
Best Price, Torrance, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Vendeur AbeBooks depuis 30 août 2024
Cet article spécifique n'est plus disponible.
A propos de cet article
Description :
SUPER FAST SHIPPING. N° de réf. du vendeur 9783540133728
Synopsis :
No Mathematical Foundations of Computer Science 1984 Read a customer review or write one .
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Détails bibliographiques
Titre : Mathematical Foundations of Computer Science...
Éditeur : Springer
Date d'édition : 1984
Reliure : Couverture souple
Etat : New
Meilleurs résultats de recherche sur AbeBooks
Image d'archives
Mathematical Foundations of Computer Science 1984: 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings (Lecture Notes in Computer Science)
Edité par
Springer, 1984
ISBN 10 : 3540133720
ISBN 13 : 9783540133728
Ancien ou d'occasion
Paperback
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Very Good. We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. N° de réf. du vendeur UTD14a-0217
Acheter D'occasion
EUR 45,10
Frais de port :
EUR 6,02
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1984
Edité par
Springer Berlin Heidelberg, 1984
ISBN 10 : 3540133720
ISBN 13 : 9783540133728
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 4882180
Acheter neuf
EUR 48,37
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1984 | 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Mathematical Foundations of Computer Science 1984 | 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings | V. Koubek (u. a.) | Taschenbuch | xiv | Englisch | 1984 | Springer-Verlag GmbH | EAN 9783540133728 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 102153437
Acheter neuf
EUR 50,35
Frais de port :
EUR 70
De Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 1984: 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings (Lecture Notes in Computer Science, 176)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020160184
Acheter neuf
EUR 53,47
Frais de port :
EUR 3,44
Vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1984 : 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings
Edité par
Springer Berlin Heidelberg, 1984
ISBN 10 : 3540133720
ISBN 13 : 9783540133728
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 generalized words of Thue-Morse.- Nondeterminism is essential for two-way counter machines.- Weak and strong fairness in CCS.- On the complexity of inductive inference.- Monotone edge sequences in line arrangements and applications.- Many-sorted temporal logic for multi-processes systems.- Process logics : two decidability results.- On searching of special classes of mazes and finite embedded graphs.- The power of the future perfect in program logics.- Hierarchy of reversal and zerotesting bounded multicounter machines.- On the power of alternation in finite automata.- The equivalence problem and correctness formulas for a simple class of programs.- Lower bounds for polygon simplicity testing and other problems.- A uniform independence of invariant sentences.- On the equivalence of compositions of morphisms and inverse morphisms on regular languages.- Some connections between presentability of complexity classes and the power of formal systems of reasoning.- Finding a maximum flow in /s,t/-planar network in linear expected time.- Nondeterministic logspace reductions.- Factoring multivariate polynomials over algebraic number fields.- G¿del numberings, principal morphisms, combinatory algebras.- Representations of integers and language theory.- New lower bound for polyhedral membership problem with an application to linear programming.- Decidability of the equivalence problem for synchronous deterministic pushdown automata.- Models and operators for nondeterministic processes.- Algorithms for string editing which permit arbitrarily complex edit constraints.- The structure of polynomial complexity cores.- Solving visibility problems by using skeleton structures.- Another look at parameterization using algebras with subsorts.- A lower bound on complexity of branching programs.- From dynamic algebras to test algebras.- Combinatorial games with exponential space complete decision problems.- Fast recognitions of pushdown automaton and context-free languages.- Multiprocessor systems and their concurrency.- Free constructions in algebraic institutions.- Remarks on comparing expressive power of logics of programs.- The complexity of problems concerning graphs with regularities.- On the complexity of slice functions.- An exponential lower bound for one-time-only branching programs.- A topological view of some problems in complexity theory.- Propositional dynamic logic with strong loop predicate. N° de réf. du vendeur 9783540133728
Acheter neuf
EUR 53,49
Frais de port :
EUR 64,48
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1984
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1984, 1984
ISBN 10 : 3540133720
ISBN 13 : 9783540133728
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 generalized words of Thue-Morse.- Nondeterminism is essential for two-way counter machines.- Weak and strong fairness in CCS.- On the complexity of inductive inference.- Monotone edge sequences in line arrangements and applications.- Many-sorted temporal logic for multi-processes systems.- Process logics : two decidability results.- On searching of special classes of mazes and finite embedded graphs.- The power of the future perfect in program logics.- Hierarchy of reversal and zerotesting bounded multicounter machines.- On the power of alternation in finite automata.- The equivalence problem and correctness formulas for a simple class of programs.- Lower bounds for polygon simplicity testing and other problems.- A uniform independence of invariant sentences.- On the equivalence of compositions of morphisms and inverse morphisms on regular languages.- Some connections between presentability of complexity classes and the power of formal systems of reasoning.- Finding a maximum flow in /s,t/-planar network in linear expected time.- Nondeterministic logspace reductions.- Factoring multivariate polynomials over algebraic number fields.- G¿del numberings, principal morphisms, combinatory algebras.- Representations of integers and language theory.- New lower bound for polyhedral membership problem with an application to linear programming.- Decidability of the equivalence problem for synchronous deterministic pushdown automata.- Models and operators for nondeterministic processes.- Algorithms for string editing which permit arbitrarily complex edit constraints.- The structure of polynomial complexity cores.- Solving visibility problems by using skeleton structures.- Another look at parameterization using algebras with subsorts.- A lower bound on complexity of branching programs.- From dynamic algebras to test algebras.- Combinatorial games with exponential space complete decision problems.- Fast recognitions of pushdown automaton and context-free languages.- Multiprocessor systems and their concurrency.- Free constructions in algebraic institutions.- Remarks on comparing expressive power of logics of programs.- The complexity of problems concerning graphs with regularities.- On the complexity of slice functions.- An exponential lower bound for one-time-only branching programs.- A topological view of some problems in complexity theory.- Propositional dynamic logic with strong loop predicate. 600 pp. Englisch. N° de réf. du vendeur 9783540133728
Acheter neuf
EUR 53,49
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1984
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1984, 1984
ISBN 10 : 3540133720
ISBN 13 : 9783540133728
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 generalized words of Thue-Morse.- Nondeterminism is essential for two-way counter machines.- Weak and strong fairness in CCS.- On the complexity of inductive inference.- Monotone edge sequences in line arrangements and applications.- Many-sorted temporal logic for multi-processes systems.- Process logics : two decidability results.- On searching of special classes of mazes and finite embedded graphs.- The power of the future perfect in program logics.- Hierarchy of reversal and zerotesting bounded multicounter machines.- On the power of alternation in finite automata.- The equivalence problem and correctness formulas for a simple class of programs.- Lower bounds for polygon simplicity testing and other problems.- A uniform independence of invariant sentences.- On the equivalence of compositions of morphisms and inverse morphisms on regular languages.- Some connections between presentability of complexity classes and the power of formal systems of reasoning.- Finding a maximum flow in /s,t/-planar network in linear expected time.- Nondeterministic logspace reductions.- Factoring multivariate polynomials over algebraic number fields.- G¿del numberings, principal morphisms, combinatory algebras.- Representations of integers and language theory.- New lower bound for polyhedral membership problem with an application to linear programming.- Decidability of the equivalence problem for synchronous deterministic pushdown automata.- Models and operators for nondeterministic processes.- Algorithms for string editing which permit arbitrarily complex edit constraints.- The structure of polynomial complexity cores.- Solving visibility problems by using skeleton structures.- Another look at parameterization using algebras with subsorts.- A lower bound on complexity of branching programs.- From dynamic algebras to test algebras.- Combinatorial games with exponential space complete decision problems.- Fast recognitions of pushdown automaton and context-free languages.- Multiprocessor systems and their concurrency.- Free constructions in algebraic institutions.- Remarks on comparing expressive power of logics of programs.- The complexity of problems concerning graphs with regularities.- On the complexity of slice functions.- An exponential lower bound for one-time-only branching programs.- A topological view of some problems in complexity theory.- Propositional dynamic logic with strong loop predicate.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 600 pp. Englisch. N° de réf. du vendeur 9783540133728
Acheter neuf
EUR 53,49
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 1984: 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings (Lecture Notes in Computer Science, 176)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540133728_new
Acheter neuf
EUR 57,33
Frais de port :
EUR 13,57
De Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Mathematical Foundations of Computer Science 1984
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 600. N° de réf. du vendeur 263069683
Acheter neuf
EUR 257,11
Frais de port :
EUR 3,44
Vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 1984
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Print on Demand pp. 600 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 5859628
Acheter neuf
EUR 277,31
Frais de port :
EUR 7,36
De Royaume-Uni vers Etats-Unis
Quantité disponible : 4 disponible(s)