|
" Automata, languages, and programming : "
edited by J.W. de Bakker and J. van Leeuwen.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
746011
|
| Doc. No
|
:
|
b565960
|
| Main Entry
|
:
|
edited by J.W. de Bakker and J. van Leeuwen.
|
| Title & Author
|
:
|
Automata, languages, and programming : : seventh colloquium, Noordwijkerhout, the Netherlands, July 14-18, 1980\ edited by J.W. de Bakker and J. van Leeuwen.
|
| Publication Statement
|
:
|
Berlin ; New York : Springer-Verlag, 1980
|
| Series Statement
|
:
|
Lecture notes in computer science, 85.
|
| Page. NO
|
:
|
(viii, 671 pages)
|
| ISBN
|
:
|
3540393463
|
|
|
:
|
: 9783540393467
|
| Contents
|
:
|
How to get rid of pseudoterminals --; Test sets for homomorphism equivalence on context free languages --; Languages with homomorphic replacements --; Functions equivalent to integer multiplication --; Languages with reducing reflexive types --; Semantics of unbounded nondeterminism --; A shifting algorithm for min-max tree partitioning --; A characterisation of computable data types by means of a finite equational specification method --; A note on sweeping automata --; Border rank of a p×q×2 tensor and the optimal approximation of a pair of bilinear forms --; Derivations et reductions dans les grammaires algebrioues --; Semantic analysis of communicating sequential processes --; Dos systems and languages --; Algebraic implementation of abstract data types: concept, syntax, semantics and correctness --; Parameterized data types in algebraic specification languages --; Characterizing correctness properties of parallel programs using fixpoints --; Formal properties of one-visit and multi-pass attribute grammars (extended abstract) --; Cryptocomplexity and NP-completeness --; On the analysis of tree-matching algorithms --; Generating and searching sets induced by networks --; The complexity of the inequivalence problem for regular expressions with intersection --; An almost linear time algorithm for computing a dependency basis in a relational data base --; Bipolar synchronization systems --; Testing of properties of finite algebras --; A transaction model --; On observing nondeterminism and concurrency --; Terminal algebra semantics and retractions for abstract data types --; The complexity of semilinear sets --; A theory of nondeterminism --; A representation theorem for models of *-free PDL --; Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions --; Symmertric space-bounded computation (extended abstract) --; On some properties of local testability --; Semantics :Algebras, fixed points, axioms --; Measuring the expressive power of dynamic logics: An application of abstract model theory --; Pebbling mountain ranges and its application to DCFL-recognition --; Space-restricted attribute grammars --; A constructive approach to compiler correctness --; A worst-case analysis of nearest neighbor searching by projection --; Proprietes syntactiques du produit non ambigu --; On the optimal assignment of attributes to passes in multi-pass attribute evaluators --; Optimal unbounded search strategies --; A "fast implementation" of a multidimensional storage into a tree storage --; Grammatical families --; Partitioned chain grammars --; An improved program for constructing open hash tables --; On the power of commutativity in cryptography --; Characterizations of the LL(k) property --; Computability in categories --; On the size complexity of monotone formulas --; Reversible computing --; The use of metasystem transition in theorem proving and program optimization --; On the power of real-time turing machines under varying specifications.
|
| Subject
|
:
|
Computer programming -- Congresses.
|
| Subject
|
:
|
Formal languages -- Congresses.
|
| Subject
|
:
|
Machine theory -- Congresses.
|
| Added Entry
|
:
|
European Association for Theoretical Computer Science.
|
|
|
:
|
J van Leeuwen
|
|
|
:
|
J W de Bakker
|
| Parallel Title
|
:
|
ICALP
|
| |