Artículos relacionados a Mathematical Foundations of Computer Science 1975:...
Mathematical Foundations of Computer Science 1975: 4th Symposium Marianske Lazne, September 1-5, 1975: 32 (Lecture Notes in Computer Science) - Tapa blanda
Comprar nuevo
Ver este artículo
EUR 53,49
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Mathematical Foundations of Computer Science 1975:...
Imagen de archivo
Mathematical Foundations of Computer Science 1975: 4th Symposium Marianske Lazne, September 1-5, 1975: 32 (Lecture Notes in Computer Science, 32) [Paperback] Becvar, J.
Librería: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. Some wear to the extremities of the book. Marks in places. Inscriptions and light foxing at the front of the book. Clean and readable throughout, a decent paperback. Nº de ref. del artículo: 109511-11
Cantidad disponible: 1 disponibles
Imagen del vendedor
Mathematical foundations of computer science 1975: 4th Symposium, Marianske Lazne, Sept. 1 - 5, 1975. Lectures notes in computer science ; 32
Publicado por
Berlin, Heidelberg, New York : Springer, 1975
ISBN 10: 3540073892
ISBN 13: 9783540073895
Antiguo o usado
Broschiert
Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemania
Calificación del vendedor: 5 de 5 estrellas
Broschiert. Condición: Gut. X, 476 S. : graph. Darst. Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 730. Nº de ref. del artículo: 2174290
Cantidad disponible: 1 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 1975
Publicado por
Springer Berlin Heidelberg Aug 1975, 1975
ISBN 10: 3540073892
ISBN 13: 9783540073895
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 -InhaltsangabeConstruction of complete sample system for correctness testing.- Ten years of speedup.- On logics of discovery.- On models of protection in operating systems.- Parsing as a subtask of compiling.- Parallel recursive program schemes.- On some problems concerning Pawlak's machines.- Formal power series and growth functions of Lindenmayer systems.- On the representability of relations by deterministic and nondeterministic multi-tape automata.- On problems solvable by successive trials.- Automata and categories.- On some models of computability of boolean functions.- Automata and categories: Finiteness contra minimality.- Languages over free groups.- On the comparison of notions of approximation.- Non-linear speed-up theorem for two register minsky machines.- Systems of open paths in Petri nets.- On the largest full sub - AFL of the full AFL of context-free languages.- On complexity of nondeterministic Turing machines computations.- On closure properties of context-free derivation complexity classes.- Control structures in single block programs.- Minimal Gödel numbers and their identification in the limit.- Isomorphic representation of automata.- Extended simple regular expressions.- Conniver programs by logical point of view.- On the set of all automata with the same monoid of endomorphisms.- Nondeterministically recognizable sets of languages.- The approximation problem in computational statistics.- The continuous algebra of monadic languages.- On sets of complex-programmed Numbers.- Decision algorithms for Havel's branching automata.- Automata and categories - Input processes.- Formalization of algorithmic reasoning.- Proving program properties, symbolic evaluation and logical procedural semantics.- A contribution to error recovery.- On the analysis and synthesis problems for context-free expressions.- Monotone switching circuits and boolean matrix product.- On some lattice-theoretic properties of generable languages.- On some formal grammars generating dependency trees.- Graph walking automata.- On finding all solutions of the partitioning problem.- Greibach normal form complexity.- On correctness and essentiality of some Ianov schemas equivalence relations.- Polynomially complete problems in the logic of automate discovery.- Relational definition of computer languages.- First-order reduction of call-by-name to call-by-value.- Local disambiguating transformation.- On cardinal sequential outer measures.- On representation of sequential and parallel functions.- The theory of the modified post algebras and multidimensional automata structures.- An algebraic theory of formal languages.- On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups.- On the synthesis of automata with several initial states.- A hierarchy of regular sequence sets.- R-fuzzy grammars.- Characterization of some classes of context-free languages in terms of complexity classes.- Inductive inference of recursive functions.- Proving properties of programs by means of predicate logic.- A generalization of Scott's flow diagrams. 496 pp. Englisch. Nº de ref. del artículo: 9783540073895
Cantidad disponible: 2 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 1975 : 4th Symposium Marianske Lazne, September 1-5, 1975
Publicado por
Springer Berlin Heidelberg, 1975
ISBN 10: 3540073892
ISBN 13: 9783540073895
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 - InhaltsangabeConstruction of complete sample system for correctness testing.- Ten years of speedup.- On logics of discovery.- On models of protection in operating systems.- Parsing as a subtask of compiling.- Parallel recursive program schemes.- On some problems concerning Pawlak's machines.- Formal power series and growth functions of Lindenmayer systems.- On the representability of relations by deterministic and nondeterministic multi-tape automata.- On problems solvable by successive trials.- Automata and categories.- On some models of computability of boolean functions.- Automata and categories: Finiteness contra minimality.- Languages over free groups.- On the comparison of notions of approximation.- Non-linear speed-up theorem for two register minsky machines.- Systems of open paths in Petri nets.- On the largest full sub - AFL of the full AFL of context-free languages.- On complexity of nondeterministic Turing machines computations.- On closure properties of context-free derivation complexity classes.- Control structures in single block programs.- Minimal Gödel numbers and their identification in the limit.- Isomorphic representation of automata.- Extended simple regular expressions.- Conniver programs by logical point of view.- On the set of all automata with the same monoid of endomorphisms.- Nondeterministically recognizable sets of languages.- The approximation problem in computational statistics.- The continuous algebra of monadic languages.- On sets of complex-programmed Numbers.- Decision algorithms for Havel's branching automata.- Automata and categories - Input processes.- Formalization of algorithmic reasoning.- Proving program properties, symbolic evaluation and logical procedural semantics.- A contribution to error recovery.- On the analysis and synthesis problems for context-free expressions.- Monotone switching circuits and boolean matrix product.- On some lattice-theoretic properties of generable languages.- On some formal grammars generating dependency trees.- Graph walking automata.- On finding all solutions of the partitioning problem.- Greibach normal form complexity.- On correctness and essentiality of some Ianov schemas equivalence relations.- Polynomially complete problems in the logic of automate discovery.- Relational definition of computer languages.- First-order reduction of call-by-name to call-by-value.- Local disambiguating transformation.- On cardinal sequential outer measures.- On representation of sequential and parallel functions.- The theory of the modified post algebras and multidimensional automata structures.- An algebraic theory of formal languages.- On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups.- On the synthesis of automata with several initial states.- A hierarchy of regular sequence sets.- R-fuzzy grammars.- Characterization of some classes of context-free languages in terms of complexity classes.- Inductive inference of recursive functions.- Proving properties of programs by means of predicate logic.- A generalization of Scott's flow diagrams. Nº de ref. del artículo: 9783540073895
Cantidad disponible: 1 disponibles
Imagen de archivo
Mathematical Foundations of Computer Science 1975: 4th Symposium Marianske Lazne, September 1-5, 1975 (Lecture Notes in Computer Science, 32)
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: ria9783540073895_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 1975
Publicado por
Springer Berlin Heidelberg, 1975
ISBN 10: 3540073892
ISBN 13: 9783540073895
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. Construction of complete sample system for correctness testing.- Ten years of speedup.- On logics of discovery.- On models of protection in operating systems.- Parsing as a subtask of compiling.- Parallel recursive program schemes.- On some problems concern. Nº de ref. del artículo: 4879575
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Mathematical Foundations of Computer Science 1975
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1975, 1975
ISBN 10: 3540073892
ISBN 13: 9783540073895
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -InhaltsangabeConstruction of complete sample system for correctness testing.- Ten years of speedup.- On logics of discovery.- On models of protection in operating systems.- Parsing as a subtask of compiling.- Parallel recursive program schemes.- On some problems concerning Pawlak's machines.- Formal power series and growth functions of Lindenmayer systems.- On the representability of relations by deterministic and nondeterministic multi-tape automata.- On problems solvable by successive trials.- Automata and categories.- On some models of computability of boolean functions.- Automata and categories: Finiteness contra minimality.- Languages over free groups.- On the comparison of notions of approximation.- Non-linear speed-up theorem for two register minsky machines.- Systems of open paths in Petri nets.- On the largest full sub - AFL of the full AFL of context-free languages.- On complexity of nondeterministic Turing machines computations.- On closure properties of context-free derivation complexity classes.- Control structures in single block programs.- Minimal Gödel numbers and their identification in the limit.- Isomorphic representation of automata.- Extended simple regular expressions.- Conniver programs by logical point of view.- On the set of all automata with the same monoid of endomorphisms.- Nondeterministically recognizable sets of languages.- The approximation problem in computational statistics.- The continuous algebra of monadic languages.- On sets of complex-programmed Numbers.- Decision algorithms for Havel's branching automata.- Automata and categories - Input processes.- Formalization of algorithmic reasoning.- Proving program properties, symbolic evaluation and logical procedural semantics.- A contribution to error recovery.- On the analysis and synthesis problems for context-free expressions.- Monotone switching circuits and boolean matrix product.- On some lattice-theoretic properties of generable languages.- On some formal grammars generating dependency trees.- Graph walking automata.- On finding all solutions of the partitioning problem.- Greibach normal form complexity.- On correctness and essentiality of some Ianov schemas equivalence relations.- Polynomially complete problems in the logic of automate discovery.- Relational definition of computer languages.- First-order reduction of call-by-name to call-by-value.- Local disambiguating transformation.- On cardinal sequential outer measures.- On representation of sequential and parallel functions.- The theory of the modified post algebras and multidimensional automata structures.- An algebraic theory of formal languages.- On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups.- On the synthesis of automata with several initial states.- A hierarchy of regular sequence sets.- R-fuzzy grammars.- Characterization of some classes of context-free languages in terms of complexity classes.- Inductive inference of recursive functions.- Proving properties of programs by means of predicate logic.- A generalization of Scott's flow diagrams.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 496 pp. Englisch. Nº de ref. del artículo: 9783540073895
Cantidad disponible: 1 disponibles
Imagen de archivo
Mathematical Foundations of Computer Science 1975
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 476. Nº de ref. del artículo: 263063740
Cantidad disponible: 4 disponibles
Imagen de archivo
Mathematical Foundations of Computer Science 1975
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. 476. Nº de ref. del artículo: 5832803
Cantidad disponible: 4 disponibles
Imagen de archivo
Mathematical Foundations of Computer Science 1975: 4th Symposium Marianske Lazne, September 1-5, 1975 (Lecture Notes in Computer Science)
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 1975 edition. 484 pages. 9.30x6.50x0.90 inches. In Stock. Nº de ref. del artículo: x-3540073892
Cantidad disponible: 2 disponibles