<電子ブック>
Automata, Languages and Programming : Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings / edited by G. Ausiello, C. Böhm
(Lecture Notes in Computer Science. ISSN:16113349 ; 62)
版 | 1st ed. 1978. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1978 |
本文言語 | 英語 |
大きさ | X, 510 p : online resource |
著者標目 | Ausiello, G editor Böhm, C editor SpringerLink (Online service) |
件 名 | LCSH:Mathematical logic LCSH:Computer science FREE:Mathematical Logic and Foundations FREE:Computer Science FREE:Theory of Computation |
一般注記 | 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 HTTP:URL=https://doi.org/10.1007/3-540-08860-1 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540358077 |
|
電子リソース |
|
EB00224858 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA8.9-10.3 DC23:511.3 |
書誌ID | 4001088667 |
ISBN | 9783540358077 |
類似資料
この資料の利用統計
このページへのアクセス回数:1回
※2017年9月4日以降