werner kuich (13 Ergebnisse)

374 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 3540137165 Sprache: Englisch Gewicht in Gramm: 990.

Zustand: New. In.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - DLT 2001 was the fth Conference on Developments in Language Theory. It was a broadly based conference covering all aspects of Language Theory: grammars and - ceptorsforstrings,graphs,arrays,etc. ;ef cientalgorithmsforlanguages;combinatorial andalgebraicpropertiesoflanguages;decisionproblems;relationstocomp lexitytheory; logic; picture description and analysis; DNA computing; cryptography; concurrency. DLT 2001 was held at Technische Universitat Wien from July 16 to July 21, 2001. The OrganizingCommitteeconsistedofRudolfFreund,WernerKuich(chairman),Christiane Nikoll, Margarethe Soukup, Friedrich Urbanek. Previous DLTs were held in Turku (1993), Magdeburg (1995), Thessalonike (1997), Aachen (1999). The Program Committee of DLT 2001 consisted of Christian Choffrut (Paris), J urgen Dassow (Magdeburg), Masami Ito (Kyoto), Werner Kuich (Wien, chairman),GiancarloMauri(Milano),GheorghePaun (Bucuresti), GrzegorzRozenberg (Leiden), Arto Salomaa (Turku), Wolfgang Thomas (Aachen). It selected 24 papers from 64 papers submitted in response to the call for papers. These papers came from the following countries: Australia, Austria, Belgium, Brazil, Bulgaria, Canada, Czech Republic, Estonia, Finland, France, Germany, Hungary, India, Italy, Japan, Moldova, The Netherlands, Phillipines, Poland, Romania, Russia, Slovakia, Spain, United Kingdom, USA. Each submitted paper was evaluated by at least four members of the Program Committee. Together with 10 invited presentations all 24 selected papers are contained in this volume. The papers in this volume are printed according to the order of presentation at DLT 2001 and thus grouped into sessions, most of which are thematic. It is a pleasure for the editors to thank the members of the Program Committee for the evaluation of the papers, and the many referees who assisted in this process.

Zustand: Gut. Zustand: Gut - Neubindung, Buchecken und -kanten leicht angestoßen, Buchrücken leicht angestoßen und eingerissen, Ausgabe 2011 | Seiten: 363 | Sprache: Englisch | Produktart: Bücher.

Zustand: New.

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

Zustand: New. In.

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: New. In.

Zustand: New. In.

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.