Articles liés à Fundamentals of Computation Theory: Proceedings of...
Fundamentals of Computation Theory: Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985 - Couverture souple
Synopsis
This volume contains abridged versions of most of the sectional talks and some invited lectures given at the International Conference on Fundamentals of Computation Theory held at Kazan State University, Kazan, USSR, June 22-26, 1987. The conference was the sixth in the series of FCT Conferences organized every odd year, and the first one to take place in the USSR. FCT '87 was organized by the Section of Discrete Mathematics of the Academy of Sciences in the USSR, the Moscow State University (Department of Discrete Mathematics), and the Kazan State University (Department of Theoretical Cybernetics). This volume contains selected contributions to the following fields: Mathematical Models of Computation, Synthesis and Complexity of Control Systems, Probabilistic Computations, Theory of Programming, Computer-Assisted Deduction. The volume reflects the fact that FCT '87 was organized in the USSR: A wide range of problems typical of research in Mathematical Cybernetics in the USSR is comprehensively represented.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 45,74
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Fundamentals of Computation Theory: Proceedings of...
Image d'archives
Fundamentals of Computation Theory : Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985
Edité par
Springer Berlin Heidelberg, 1985
ISBN 10 : 3540156895
ISBN 13 : 9783540156895
Ancien ou d'occasion
Couverture souple
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Gut. Zustand: Gut | Seiten: 564 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 3937040/203
Quantité disponible : 1 disponible(s)
Image d'archives
Fundamentals of Computation Theory: Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985 (Lecture Notes in Computer Science)
Edité par
Springer-Verlag, OHG, Berlin, Germany, 1985
ISBN 10 : 3540156895
ISBN 13 : 9783540156895
Ancien ou d'occasion
Paperback
Edition originale
Vendeur : SUNSET BOOKS 2, Newark, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Very Good. No Jacket. 1st. Seller's image, know what you are getting! Pre-packing weight is 1 lb. 15.6 oz . ORIGINAL, NOT A REPRINT OR PHOTOCOPY!! NO Dust Jacket. Has all standard Library markings, pocket, labels, stamps, light wear and soil to covers. CLEAN TEXT! See Picture! The Copyright date is 1985 for this Printing. This volume was purchased through DMRO from the Wright-Patterson Technical Library in the late 1990's. Thank you for your purchase from Sunset Books! Help Promote World Literacy, GIVE a Book as a GIFT!! In stock, Ships from Ohio. WE COMBINE SHIPPING ON MULTIPLE PURCHASES!!!! SEE PICTURES!!!!! ANY ODD/GREEN TONES ON THE SCANS ARE CAUSED BY MY SCANNER!! All of our Technical/Textbook/Ex-Library volumes were obtained legally through Public or Auction sales. Size: 8vo. Ex-Library. N° de réf. du vendeur 015532
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Fundamentals of Computation Theory
Edité par
Springer Berlin Heidelberg, 1985
ISBN 10 : 3540156895
ISBN 13 : 9783540156895
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Space complexity of alternating Turing machines.- A unifying theorem for algebraic semantics and dynamic logics.- On some non-uniform complexity measures.- Fast parallel vertex colouring.- Muller automata and bi-infinite words.- On formal languages, proba. N° de réf. du vendeur 4882727
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Fundamentals of Computation Theory : Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985
Edité par
Springer Berlin Heidelberg, 1985
ISBN 10 : 3540156895
ISBN 13 : 9783540156895
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 - Space complexity of alternating Turing machines.- A unifying theorem for algebraic semantics and dynamic logics.- On some 'non-uniform' complexity measures.- Fast parallel vertex colouring.- Muller automata and bi-infinite words.- On formal languages, probabilities, paging and decoding algorithms.- On the restriction of some NP-complete graph problems to permutation graphs.- Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic.- Algorithms solving path systems.- Decidability of confluence for ground term rewriting systems.- Lower bounds on the complexity of 1-time only branching programs (Preliminary version).- On coordinated rewriting.- Elements of a general theory of combinatorial structures.- A language theoretic approach to serialization problem in concurrent systems.- Logic programming and substitutions.- A lower bound on the oscilation complexity of context-free languages.- Depth efficient transformations of arithmetic into boolean circuits.- Free cost measures of trees.- Discrete extremal problems on covering.- Parallel algorithms for connected components in a graph.- Statistical testing of finite sequences based on algorithmic complexity.- Lower bounds for boolean formulae of depth 3 and the topology of the n-Cube (Preliminary version).- Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.- Linear comparison complexity of the n-cube membership problem.- String grammars with disconnecting.- Array processing machines.- A fast heuristic for covering polygons by rectangles.- .- Products of group languages.- The complexity of embedding graphs into binary trees.- On some topological properties of logic programs.- Recent results on continuous ordered algebras.- Are lower bounds on the complexity lower bounds for universal circuits .- Probabilistic algorithms in group theory.- Recent results on codes.- A multiparameter analysis of the boundedness problem for vector addition systems.- About two-way transducers.- Parallel time O(log N) recognition of unambiguous CFLs.- On colour critical graphs.- Generalized thue-morse sequences.- Tree-partite graphs and the complexity of algorithms.- A quadratic regularity test for non-deleting macro s grammars.- Continuous abstract data types: Basic machinery and results.- On the length of single dynamic tests for monotone boolean functions.- Enumerative combinatorics and algebraic languages.- On several kinds of space-bounded on-line multicounter automata.- Iterated linear control and iterated one-turn pushdowns.- On the boolean closure of NP.- The critical complexity of all (monotone) boolean functions and monotone graph properties.- Degeneration of Shimura surfaces and a problem in coding theory.- Quantifiers in combinatory PDL: Completeness, definability, incompleteness.- Partial ordering derivations for CCS.- Intersecting two polyhedra one of which is convex. N° de réf. du vendeur 9783540156895
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Fundamentals of Computation Theory
Edité par
Springer Berlin Heidelberg Aug 1985, 1985
ISBN 10 : 3540156895
ISBN 13 : 9783540156895
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 -Space complexity of alternating Turing machines.- A unifying theorem for algebraic semantics and dynamic logics.- On some 'non-uniform' complexity measures.- Fast parallel vertex colouring.- Muller automata and bi-infinite words.- On formal languages, probabilities, paging and decoding algorithms.- On the restriction of some NP-complete graph problems to permutation graphs.- Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic.- Algorithms solving path systems.- Decidability of confluence for ground term rewriting systems.- Lower bounds on the complexity of 1-time only branching programs (Preliminary version).- On coordinated rewriting.- Elements of a general theory of combinatorial structures.- A language theoretic approach to serialization problem in concurrent systems.- Logic programming and substitutions.- A lower bound on the oscilation complexity of context-free languages.- Depth efficient transformations of arithmetic into boolean circuits.- Free cost measures of trees.- Discrete extremal problems on covering.- Parallel algorithms for connected components in a graph.- Statistical testing of finite sequences based on algorithmic complexity.- Lower bounds for boolean formulae of depth 3 and the topology of the n-Cube (Preliminary version).- Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.- Linear comparison complexity of the n-cube membership problem.- String grammars with disconnecting.- Array processing machines.- A fast heuristic for covering polygons by rectangles.- .- Products of group languages.- The complexity of embedding graphs into binary trees.- On some topological properties of logic programs.- Recent results on continuous ordered algebras.- Are lower bounds on the complexity lower bounds for universal circuits .- Probabilistic algorithms in group theory.- Recent results on codes.- A multiparameter analysis of the boundedness problem for vector addition systems.- About two-way transducers.- Parallel time O(log N) recognition of unambiguous CFLs.- On colour critical graphs.- Generalized thue-morse sequences.- Tree-partite graphs and the complexity of algorithms.- A quadratic regularity test for non-deleting macro s grammars.- Continuous abstract data types: Basic machinery and results.- On the length of single dynamic tests for monotone boolean functions.- Enumerative combinatorics and algebraic languages.- On several kinds of space-bounded on-line multicounter automata.- Iterated linear control and iterated one-turn pushdowns.- On the boolean closure of NP.- The critical complexity of all (monotone) boolean functions and monotone graph properties.- Degeneration of Shimura surfaces and a problem in coding theory.- Quantifiers in combinatory PDL: Completeness, definability, incompleteness.- Partial ordering derivations for CCS.- Intersecting two polyhedra one of which is convex. 564 pp. Englisch. N° de réf. du vendeur 9783540156895
Quantité disponible : 2 disponible(s)
Image d'archives
Fundamentals of Computation Theory: Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985 (Lecture Notes in Computer Science, 199)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540156895_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Fundamentals of Computation Theory
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1985, 1985
ISBN 10 : 3540156895
ISBN 13 : 9783540156895
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -Space complexity of alternating Turing machines.- A unifying theorem for algebraic semantics and dynamic logics.- On some 'non-uniform' complexity measures.- Fast parallel vertex colouring.- Muller automata and bi-infinite words.- On formal languages, probabilities, paging and decoding algorithms.- On the restriction of some NP-complete graph problems to permutation graphs.- Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic.- Algorithms solving path systems.- Decidability of confluence for ground term rewriting systems.- Lower bounds on the complexity of 1-time only branching programs (Preliminary version).- On coordinated rewriting.- Elements of a general theory of combinatorial structures.- A language theoretic approach to serialization problem in concurrent systems.- Logic programming and substitutions.- A lower bound on the oscilation complexity of context-free languages.- Depth efficient transformations of arithmetic into boolean circuits.- Free cost measures of trees.- Discrete extremal problems on covering.- Parallel algorithms for connected components in a graph.- Statistical testing of finite sequences based on algorithmic complexity.- Lower bounds for boolean formulae of depth 3 and the topology of the n-Cube (Preliminary version).- Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.- Linear comparison complexity of the n-cube membership problem.- String grammars with disconnecting.- Array processing machines.- A fast heuristic for covering polygons by rectangles.- .- Products of group languages.- The complexity of embedding graphs into binary trees.- On some topological properties of logic programs.- Recent results on continuous ordered algebras.- Are lower bounds on the complexity lower bounds for universal circuits .- Probabilistic algorithms in group theory.- Recent results on codes.- A multiparameter analysis of the boundedness problem for vector addition systems.- About two-way transducers.- Parallel time O(log N) recognition of unambiguous CFLs.- On colour critical graphs.- Generalized thue-morse sequences.- Tree-partite graphs and the complexity of algorithms.- A quadratic regularity test for non-deleting macro s grammars.- Continuous abstract data types: Basic machinery and results.- On the length of single dynamic tests for monotone boolean functions.- Enumerative combinatorics and algebraic languages.- On several kinds of space-bounded on-line multicounter automata.- Iterated linear control and iterated one-turn pushdowns.- On the boolean closure of NP.- The critical complexity of all (monotone) boolean functions and monotone graph properties.- Degeneration of Shimura surfaces and a problem in coding theory.- Quantifiers in combinatory PDL: Completeness, definability, incompleteness.- Partial ordering derivations for CCS.- Intersecting two polyhedra one of which is convex.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 564 pp. Englisch. N° de réf. du vendeur 9783540156895
Quantité disponible : 2 disponible(s)
Image d'archives
Fundamentals of Computation Theory : Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540156895
Quantité disponible : 10 disponible(s)
Image d'archives
Fundamentals of Computation Theory
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 564. N° de réf. du vendeur 263061844
Quantité disponible : 4 disponible(s)
Image d'archives
Fundamentals of Computation Theory
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 564. N° de réf. du vendeur 183061854
Quantité disponible : 4 disponible(s)