Werner kuich (25 Ergebnisse)

Zustand: Very Good. 1st Edition. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. …

Zustand: New.

Paperback. Zustand: New. 2011. This Festschrift volume, published in honor of Symeon Bozapalidis on the occasion of his retirement after more than 35 years of teaching activity, focuses on the subjects taught by Symeon, namely: algebra, linear algebra, mathematical logic, number theory, automata theory, tree languages and series, algebraic semantics, and fuzzy languages. Since 1982 -- at the Aristotle University of Thessaloniki -- Symeon's main interests have been closely connected with the algebraic foundations in computer science. In particular, he contributed to the development of the theory of tree languages and series, the axiomatization of graphs, picture theory, and fuzzy languages.The volume contains 15 invited papers, written by colleagues, friends, and students of Symeon. All of the papers were carefully refereed and are connected to his research topics. Most of the papers were presented at the Workshop on Algebraic Foundations in Computer Science, held in Thessaloniki, Greece, during November 7--8, 2011.…

paperback. Zustand: Sehr gut. 376 Seiten; 9783642248962.2 Gewicht in Gramm: 1.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: Brand New. 2011 edition. 373 pages. 9.29x6.14x0.79 inches. In Stock.

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Presentations.- Automata: From Uncertainty to Quantum.- Elementary Theory of Ordinals with Addition and Left Translation by .- The Equational Theory of Fixed Points with Applications to Generalized Language Theory.- Second-Order Logic over Strings: Regular and Non-regular Fragments.- Decision Questions on Integer Matrices.- Some Petri Net Languages and Codes.- Words, Permutations, and Representations of Numbers.- Proof Complexity of Pigeonhole Principles.- Words and Patterns.- A Short Introduction to Infinite Automata.- Contributions.- The Power of One-Letter Rational Languages.- The Entropy of Lukasiewicz-Languages.- Collapsing Words vs. Synchronizing Words.- A Note on Synchronized Automata and Road Coloring Problem.- Shuffle Quotient and Decompositions.- The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages.- Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable.- Automata on Series-Parallel Biposets.- Hierarchies of String Languages Generated by Deterministic Tree Transducers.- Partially-Ordered Two-Way Automata: A New Characterization of DA.- Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets.- On the Power of Randomized Pushdown Automata.- The Root of a Language and Its Complexity.- Valuated and Valence Grammars: An Algebraic View.- Context-Free Valence Grammars - Revisited.- An Undecidability Result Concerning Periodic Morphisms.- A Universal Turing Machine with 3 States and 9 Symbols.- Minimal Covers of Formal Languages.- Some Regular Languages That Are Church-Rosser Congruential.- On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy.- Forbidden Factors and Fragment Assembly.- Parallel Communicating Grammar Systems with Incomplete InformationCommunication.- Eliminating Communication by Parallel Rewriting.- String Rewriting Sequential P-Systems and Regulated Rewriting.…

Hardcover. 1. 374 p. Good condition. Reading pages are clean and without marks. Retired library exemplar, with the usual marking. Book shows slight signs of storage and usage. Author's signature by Werner Kuich on the first page. No dust jacket. Still good copy. 9783540137160 Sprache: Englisch Gewicht in Gramm: 1000.…

Zustand: Gut. Zustand: Gut | Seiten: 363 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

In Englisch. gr.-8°, IX, 388 S., OKart., geringe Gebrauchs- und Stellspuren, ausgeschiedenes Bibl.-Expl. mit den entsprechenden Kennzeichnungen. ISBN 9783540434534.

Paperback. Zustand: New. 2011. This Festschrift volume, published in honor of Symeon Bozapalidis on the occasion of his retirement after more than 35 years of teaching activity, focuses on the subjects taught by Symeon, namely: algebra, linear algebra, mathematical logic, number theory, automata theory, tree languages and series, algebraic semantics, and fuzzy languages. Since 1982 -- at the Aristotle University of Thessaloniki -- Symeon's main interests have been closely connected with the algebraic foundations in computer science. In particular, he contributed to the development of the theory of tree languages and series, the axiomatization of graphs, picture theory, and fuzzy languages.The volume contains 15 invited papers, written by colleagues, friends, and students of Symeon. All of the papers were carefully refereed and are connected to his research topics. Most of the papers were presented at the Workshop on Algebraic Foundations in Computer Science, held in Thessaloniki, Greece, during November 7--8, 2011.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume presents the proceedings of the 19thInternational Colloquium onAutomata, Languages, andProgramming (ICALP 92) in a series of meetings sponsored bythe European Association for Theoretical Computer Science(EATCS).ICALP is a broadly based conference covering all aspects oftheoretical computer science, including such topics ascomputability, automata, formal languages, term rewriting,analysis of algorithms, computational geometry,computational complexity, symbolic and algebraiccomputation, cryptography, data types and data structures,theory of databases and knowledge bases, semantics ofprogramming languages, program specification, transformationand verification, foundations of logic programming, theoryof logical design andlayout, parallel and distributedcomputation, theory of concurrency, and theory of robotics.The papers in the volume are grouped into thematic partscorresponding to their order of presentation at ICALP 92.…

Zustand: gut. 1986. Semirings, automata, languages Werner Kuich ; Arto Salomaa In deutscher Sprache. pages.

Taschenbuch. Zustand: Neu. Handbook of Weighted Automata | Manfred Droste (u. a.) | Taschenbuch | Monographs in Theoretical Computer Science. An EATCS Series | xvii | Englisch | 2012 | Springer | EAN 9783642260490 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Zustand: New.

Hardback. Zustand: New. 2009 ed. The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the "resources" by "profit" and then be interested in the maximal profit realized, correspondingly, by a given word.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the 'resources' by 'profit' and then be interested in the maximal profit realized, correspondingly, by a given word.…

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the 'resources' by 'profit' and then be interested in the maximal profit realized, correspondingly, by a given word.…

Paperback. Zustand: Brand New. 2009 edition. 625 pages. 9.25x6.10x1.27 inches. In Stock.

Hardcover. Zustand: Brand New. 1st edition. 608 pages. 9.53x6.38x1.73 inches. In Stock.

Hardback. Zustand: New. 2009 ed. The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the "resources" by "profit" and then be interested in the maximal profit realized, correspondingly, by a given word.…