Gecseg (74 results)

hardcover. Condition: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned.…

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.

Hardcover. Condition: Very Good. Prompt Shipment, shipped in Boxes, Tracking PROVIDEDVery good in Very good dust jacket.

Paperback. Condition: Very Good. No Dust Jacket. Lecture Notes in Computer Science 380; Ex-Library. Ink stamp and previous owner's sticker on the front cover. Small pen inscription on title page; library catalogue sticker on colophon. Minute traces of sticker residue and faint scuffs across the spine head. Sound, clean book with tight binding. ADG. Ex-Library.…

Softcover. Condition: ex library-good. Lecture Notes in Computer Scince 117. x, 471 p. 24 cm. Ex library with labels on spine and rear free endpaper, ink stamps on top edge and title. Paper browning.

Condition: New.

Paperback or Softback. Condition: New. Fundamentals of Computation Theory: Proceedings of the 1981 International Fct-Conference, Szeged, Hungaria, August 24-28, 1981. Book.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Softcover Sehr gut erhalten.

326 S., Sprache: Englisch Gewicht in Gramm: 820 Groß 8°, Original-Leinen (Hardcover), Bibliotheks-Exemplar (ordnungsgemäß entwidmet) mit Rückenschild, Stempel auf Titel, Einband in selbstklebende transparente Schutzfolie eingeschlagen, insgesamt gutes und innen sauberes Exemplar.

Condition: New.

Condition: New.

hardcover. Condition: Good. Hardcover in good condition. No jacket. Ex-university library. Text in English, German, French and Russian. Library binding. Volumes 33 and 34 bound together. Light edge-wear and bumps on hardcover. Page block and a few pages are lightly marked and tanned. Library plate on front pastedown. Stamps and creases on some pages. Text is clear throughout. HCW. Used.…

hardcover. Condition: Good. Hardcover in good condition. No jacket. Ex-university library. Text in English, German, French and Russian. Library binding. Volumes 35 and 36 bound together. Light edge-wear and bumps on hardcover. Page block and a few pages are lightly marked and tanned. Library plate on front pastedown. Stamps and creases on some pages. Text is clear throughout. HCW. Used.…

Hardcover mit Umschlag Sehr gut erhalten.

Softcover. 1981. 471 p. ATTENTION 1981 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540108542 Sprache: Englisch Gewicht in Gramm: 816.

Condition: New. pp. 120.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.

Paperback. Condition: Brand New. 120 pages. 10.00x7.00x0.25 inches. In Stock.

Condition: New. pp. 488.

Condition: New.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Both theoretical and practical considerations motivate the repre sentation of objects as certain compositions of simpler ones. In the theory of automata this observation has led to the concepts of pro ducts and complete systems of automata. In the general form of the products of automata all the component automata are fed back to one another. With this very broad notion of products, the realization of automata with large numbers of states by means of compositions of basic components is a highly involved process; this increases the possibility of errors. In order to decrease the complexity of feedbacks, a hierarchy of products called lXi-pro ducts was introduced some 10 years ago, where i runs over the set of all non-negative integers. In an IXcproduct the index set of the component automata is linearly ordered. The input of each automaton in the product may depend on the states of all automata preceding it, i. e. , all component automata steer all those automata which follow them in the product. Furthermore, at most the next i-I automata (including itself) may be fed back to the input of a given component automaton. Thus for iXcproducts the lengths of feedbacks are at most i. The aim of this monograph is to give a systematic account of iXi-Products. It consists of five chapters, a reference section, and an index. The first chapter contains the necessary concepts and results from universal algebra, automata, and sequential machines.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Observability and Nerode equivalence in concrete categories.- Some universal algebraic and model theoretic results in computer science.- Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems.- Moderately exponential bound for graph isomorphism.- An algebraic definition of attributed transformations.- Analogies of PAL and COPY.- Quasi-equational logic for partial algeras.- Homogeneity and completeness.- On the error correcting power of pluralism in inductive inference.- Equality languages and language families.- Extremal combinatorial problems in relational data base.- Specifying algebraic data types by domain equations.- An axiomatization of regular forests in the language of algebraic theories with iteration.- Fast recognition of rings and lattices.- A definition of the P = NP-problem in categories.- Generating graph languages using hypergraph grammars.- Lower bounds for problems defined by polynomial inequalities.- What is computable for abstract data types .- On strongly cube-free -words generated by binary morphisms.- On the role of selectors in selective substitution grammars.- Classes of functions over binary trees.- Mathematical structures underlying greedy algorithms.- Some properties of language families generated by commutative languages.- Isomorphism completeness for some algebraic structures.- Reducing algebraic tree grammars.- Rational cone and substitution.- On the regularity problem of SF-languages generated by minimal linear grammars.- Co-algebras as machines for the interpretations of flow diagrams.- Random access machines and straight-line programs.- On the LBA problem.- Dynamic algebras of programs.- The equivalence problem for LL- and LR-regular grammars.- Context-free languages of infinitewords as least fixpoints.- Remarks on the notion of concurrency relation in the case of systems.- On the size of conjunctive representations of n-ary relations.- On subwords of formal languages.- First order dynamic logic with decidable proofs and workable model theory.- Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures.- Processes in Petri nets.- Some algebraic aspects of recognizability and rationality.- Pebbling and bandwidth.- On cellular graph-automata and second-order definable graph-properties.- Extensions of symmetric hom-functors to the Kleisli category.- A new operation between languages.- Logical description of computation processes.- An algorithm to identify slices, with applications to vector replacement systems.- One pebble does not suffice to search plane labyrinths.- About the by codings of environments induced posets [µ z, ] and [ z, ].- The complexity of automata and subtheories of monadic second order arithmetics.- Tape complexity of word problems.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds.…

Condition: As New. Unread book in perfect condition.

Condition: New.