Pettorossi alberto (81 resultados)

Hardcover. Condición: Very Good. No Jacket. Hardcover 2002 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good condition. Lecture Notes in Computer Science ;2372. [viii, 265 p. : fig. ; 24 cm].

Softcover. 1992. 351 p. ATTENTION 1992 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540562825 Sprache: Englisch Gewicht in Gramm: 1000.

Condición: As New. Unread book in perfect condition.

Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condición: New.

Condición: New.

Condición: New.

Paperback. Condición: New. 1st ed. 2022. Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general.Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages.  The book also examines decidable and undecidable problems with emphasis on the case for context-free languages.Topics and features:Provides theorems, examples, and exercises to clarify automata-languages correspondencesPresents some fundamental techniques for parsing both regular and context-free languagesClassifies subclasses of decidable problems, avoiding focus on the theory of complexityExamines finite-automata minimalization and characterization of their behavior using regular expressionsIllustrates how to derive grammars of context-free languages in Chomsky and Greibach normal formsOffers supplementary material on counter machines, stack automata, and abstract language familiesThis highly useful, varied text/reference is suitable for undergraduate and graduatecourses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic.Alberto Pettorossi is professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.…

Condición: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condición: New.

Condición: Very Good. Some light marks to the cover. The book is clean and readable throughout, a decent copy.

Condición: As New. Unread book in perfect condition.

Condición: New. In English.

Paperback. Condición: Brand New. 288 pages. 10.00x7.00x0.63 inches. In Stock.

Hardcover. 245 p. Good condition. Reading pages are clean and without marks. Sprache: Italienisch Gewicht in Gramm: 1000.

Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains lectures and papers delivered at Meta92, the Third International Workshop on Metaprogramming inLogic, held in Uppsala, Sweden,June 1992. The topicscovered include foundations of metaprogramming in logic,proposals for metaprogramming languages, techniques forknowledgerepresentation and belief systems, and programtransformation and analysis in logic.Particular topics include belief revision systems,intensionaldeduction, belief systems and metaprogramming,principles of partial deduction, termination in logicprograms, semantics of the 'vanilla' metainterpreter, acomplete resolution method for metaprogramming, semanticsof'demo', hierarchical metalogics, the naming relation inmetalevel systems, modules, reflective agents, compileroptimizations, metalogic and object-oriented facilities,parallel logic languages, the use of metaprogramming forlegal reasoning, representing objects and inheritance,transformation of normal programs, negation in automaticallygenerated logic programs, reordering of literals indeductive databases, abstract interpretations, andinterarguments in constraint logic programs.…

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Speaker.- Static Analysis for Safe Destructive Updates in a Functional Language.- Program Transformation and Equivalence.- A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs.- On Deforesting Parameters of Accumulating Maps.- Equivalence in Answer Set Programming.- Program Verificaion.- Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols.- Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking.- Verification of Sets of Infinite State Processes Using Program Transformation.- Program Analysis.- When Size Does Matter.- Symbolic Profiling for Multi-paradigm Declarative Languages.- Program Development.- Correct Object-Oriented Systems in Computational Logic.- A Framework for Developing Embeddable Customized Logics.- Computing Environment-Aware Agent Behaviours with Logic Program Updates.- Program Synthesis.- Extracting General Recursive Program Schemes in Nuprl's Type Theory.- Extracting Exact Time Bounds from Logical Proofs. …

Condición: As New. Unread book in perfect condition.

Condición: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Paperback/ broschiert. Condición: Gut. 351 S. Computerwissenschaften Meta-Programm Guter Zustand With figures. Ex-Library. Stamped edges. ha1061369 Sprache: Englisch Gewicht in Gramm: 600.

Paperback. Condición: Brand New. 318 pages. 10.00x7.01x0.75 inches. In Stock.

Condición: New.

Condición: New.

Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among others, algorithms for visiting trees, evaluating Boolean expressions, proving propositional formulas, computing paths in graphs, and performing string matching.This book has been used for advanced undergraduate and graduate courses on automata and formal languages, and assumes some prior exposure to the basic notions in that area.Sample programs are presented in Java and Prolog.…

Condición: New. Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences wr.

Condición: New.