Bild 1 von 1
Standardbild
Bild 1 von 1
Standardbild
Automata, Languages And Programming von G. Ausiello C. Böhm (1978, Taschenbuch)
Petra Gros Versandantiquariat (227153)
99,8% positive Bewertungen
Preis:
EUR 15,00
(inkl. MwSt.)
Ca.CHF 13,96
+ 7,40 Versand
Rücknahme:
Artikelzustand:
- Sofort-KaufenAutomata, languages and programming; Fifth Colloquium, Udine July 1978; Lecture
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Über dieses Produkt
Produktinformation
Simple EOL forms under uniform interpretation generating CF languages.- Codes : Unequal probabilities, unequal letter costs.- Sur l'inversion des morphismes d'arbres.- Grammars with dynamic control sets.- Ambiguite forte.- Relationship between density and deterministic complexity of MP-complete languages.- Stable models of typed ?-calculi.- Path measures of turing machine computations.- Une famille remarquable de codes indecomposables.- Comparisons and reset machines.- Size ¿ Depth tradeoff in boolean formulas.- (Semi)-separability of finite sets of terms in Scott's D?-models of the ?-calculus.- Mutual exclusion of N processors using an O(N)-valued message variable.- On the power of self-application and higher type recursion.- Time and space bounds for selection problems.- Stepwise specification and implementation of abstract data types.- The complexity of equivalence and containment for free single variable program schemes.- On improving the worst case running time of the Boyer-Moore string matching algorithm.- Semantics and correctness of nondeterministic flowchart programs with recursive procedures.- Arithmetical completeness in logics of programs.- Covering a graph by circuits.- A pspace complete problem related to a pebble game.- Some effective results about linear recursive sequences.- On the parsing and covering of simple chain grammars.- Sur un cas particulier de la conjecture de Cerny.- States can sometimes do more than stack symbols in PDA's.- Some decision results for recognizable sets in arbitrary monoids.- Sur les series rationnelles en variables non commutatives.- On constructing efficient evaluators for attribute grammars.- Une extension de la theorie des types en ?-calcul.- Parallel and nondeterministic time complexity classes.- Multiterminal network flow and connectivity in unsymmetrical networks.- Admissible coherent c.p.o.'s.- Integration of the phase-difference relations in asynchronous sequential networks.- Self-modifying nets, a natural extension of Petri nets.- Head recurrent terms in combinatory logic : A generalization of the notion of head normal form.- Characterization problems in the theory of inductive inference.Produktkennzeichnungen
HerausgeberG. Ausiello, C. Böhm
ISBN-103540088601
ISBN-139783540088608
eBay Product ID (ePID)62893386
Produkt Hauptmerkmale
VerlagSpringer Berlin Heidelberg, Springer Berlin
Erscheinungsjahr1978
Anzahl der Seiten520 Seiten
SpracheEnglisch, Französisch
PublikationsnameAutomata, Languages And Programming
AutorG. Ausiello, C. Böhm
ReiheLecture Notes in Computer Science
FormatTaschenbuch
Zusätzliche Produkteigenschaften
HörbuchNo
InhaltsbeschreibungPaperback
Nummer Innerhalb der Serie62
Item Height2cm
Item Length23cm
Item Width15cm
Item Weight779g
