Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979

著者

書誌事項

Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979

edited by Hermann A. Maurer

（Lecture notes in computer science, 71）

Springer-Verlag, 1979

  • : gw
  • : us

タイトル別名

ICALP '79

大学図書館所蔵 件 / 全65件

この図書・雑誌をさがす

注記

"Sponsored by EATCS (European Association Theoretical Computer Science)."--pref.

Includes bibliographies and index

One contribution in French

内容説明・目次

巻冊次

: us ISBN 9780387095103

内容説明

Introductory MEMS: Fabrication and Applications is a practical introduction to MEMS for advanced undergraduate and graduate students. Part I introduces the student to the most commonly used MEMS fabrication techniques as well as the MEMS devices produced using these techniques. Part II focuses on MEMS transducers: principles of operation, modeling from first principles, and a detailed look at commercialized MEMS devices, in addition to microfluidics. Multiple field-tested laboratory exercises are included, designed to facilitate student learning about the fundamentals of microfabrication processes. References, suggested reading, review questions, and homework problems are provided at the close of each chapter. Introductory MEMS: Fabrication and Applications is an excellent introduction to the subject, with a tested pedagogical structure and an accessible writing style suitable for students at an advanced undergraduate level across academic disciplines.

目次

  • Fabrication.- The substrate and adding material to it.- Creating and transferring patterns#x2014
  • Photolithography.- Creating structures#x2014
  • Micromachining.- Solid mechanics.- Applications.- Thinking about modeling.- MEMS transducers#x2014
  • An overview of how they work.- Piezoresistive transducers.- Capacitive transducers.- Piezoelectric transducers.- Thermal transducers.- to microfluidics.- Laboratories.- Microfabrication laboratories.
巻冊次

: gw ISBN 9783540095101

目次

Sharing in nondeterminism.- Sur les mots sans carre definis par un morphisme.- A characterization of abstract data as model-theoretic invariants.- Inherent ambiguities in families of grammars extended abstract.- Representing complexity classes by equality sets.- Supercounter machines.- Existential quantifiers in abstract data types.- A generalization of Ginsburg and Rose's characterization of G-S-M mappings.- Strict deterministic languages and controlled rewriting systems.- A string matching algorithm fast on the average.- Functional characterization of some semantic equalities inside ?-calculus.- Arbitration and queueing under limited shared storage requirements.- On the homomorphic characterizations of families of languages.- Two level grammars: CF-grammars with equation schemes.- Proving termination with multiset orderings.- One abstract accepting algorithm for all kinds of parsers.- Studies in abstract/concrete mappings in proving algorithm correctness.- A characterization of a dot-depth two analogue of generalized definite languages.- Partitioned LL(k) grammars.- Recursion schemes and generalized interpretations.- A rational theory of AFLs.- On the succinctness of different representations of languages.- A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs.- Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons.- A unique termination theorem for a theory with generalised commutative axioms.- Dags and Chomsky hierarchy.- Recent advances in the probabilistic analysis of graph-theoretic algorithms.- On the average stack size of regularly distributed binary trees.- On reductions of parallel programs.- On the height of derivation trees.- The modal logic of programs.- A comparison between two variations of a pebble game on graphs.- LL(k) parsing for attributed grammars.- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space.- Structure preserving transformations on non-left-recursive grammars.- The complexity of restricted minimum spanning tree problems.- A systematic approach to formal language theory through parallel rewriting.- Extending the notion of finite index.- On the complexity of general context-free language parsing and recognition.- Space-time tradeoffs for oblivious integer multiplication.- Investigating programs in terms of partial graphs.- On the power of random access machines.- An axiomatic treatment of ALGOL 68 routines.- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP.- Constructing call-by-value continuation semantics.- A formal semantics for concurrent systems.- On constructing LL(k) parsers.- More on advice on structuring compilers and proving them correct.- Languages of nilpotent and solvable groups (extended abstract).- Unique fixed points vs. least fixed points.- A modification of the LR(k) method for constructing compact bottom-up parsers.- Optimal decomposition of linear automata.- Bracketed two-level grammars - A decidable and practical approach to language definitions.

「Nielsen BookData」 より

関連文献： 1件中  1-1を表示

詳細情報

ページトップへ