Artículos relacionados a Fundamentals of Computation Theory: Proceedings of...
Fundamentals of Computation Theory: Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985: 199 (Lecture Notes in Computer Science) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 50,28
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Fundamentals of Computation Theory: Proceedings of...
Imagen de archivo
Fundamentals of Computation Theory : Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985
Publicado por
Springer Berlin Heidelberg, 1985
ISBN 10: 3540156895
ISBN 13: 9783540156895
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Gut. Zustand: Gut | Seiten: 564 | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 3937040/203
Cantidad disponible: 1 disponibles
Imagen de archivo
Fundamentals of Computation Theory: Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985 (Lecture Notes in Computer Science)
Publicado por
Springer-Verlag, OHG, Berlin, Germany, 1985
ISBN 10: 3540156895
ISBN 13: 9783540156895
Antiguo o usado
Paperback
Original o primera edición
Librería: SUNSET BOOKS 2, Newark, OH, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: 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 ref. del artículo: 015532
Cantidad disponible: 1 disponibles
Imagen del vendedor
Fundamentals of Computation Theory
Publicado por
Springer Berlin Heidelberg Aug 1985, 1985
ISBN 10: 3540156895
ISBN 13: 9783540156895
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783540156895
Cantidad disponible: 2 disponibles
Imagen del vendedor
Fundamentals of Computation Theory : Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985
Publicado por
Springer Berlin Heidelberg, 1985
ISBN 10: 3540156895
ISBN 13: 9783540156895
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783540156895
Cantidad disponible: 1 disponibles
Imagen de archivo
Fundamentals of Computation Theory: Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985 (Lecture Notes in Computer Science, 199)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540156895_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Fundamentals of Computation Theory
Publicado por
Springer Berlin Heidelberg, 1985
ISBN 10: 3540156895
ISBN 13: 9783540156895
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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 ref. del artículo: 4882727
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Fundamentals of Computation Theory : Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540156895
Cantidad disponible: 10 disponibles
Imagen del vendedor
Fundamentals of Computation Theory
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1985, 1985
ISBN 10: 3540156895
ISBN 13: 9783540156895
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783540156895
Cantidad disponible: 2 disponibles
Imagen de archivo
Fundamentals of Computation Theory
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 564. Nº de ref. del artículo: 263061844
Cantidad disponible: 4 disponibles
Imagen de archivo
Fundamentals of Computation Theory
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 564 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 ref. del artículo: 5834635
Cantidad disponible: 4 disponibles