This volume contains the proceedings of the Eleventh Conference on Foundations of Software Technology and Theoretical Computer Science held in New Dehli, India December 17-19, 1991. Three invited papers and 25 contributed papers selected from 78 submissions by authors from many different countries reflect the current research concerns of the theoreticalcomputer science community. The topics covered include: -Algorithms (sequential, parallel and geometric) -Automata theory -Functional programming -Learning -Logic of programs -Semantics -Structural complexity theory -Type theory.

Keywords

Bibliographic Information

Book Title: Foundations of Software Technology and Theoretical Computer Science
Book Subtitle: 11th Conference, New Delhi, India, December 17-19, 1991. Proceedings
Editors: Somenath Biswas, Kesav V. Nori
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-54967-6
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1991
Softcover ISBN: 978-3-540-54967-3Published: 27 November 1991
eBook ISBN: 978-3-540-46612-3Published: 13 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 425
Topics: Theory of Computation, Software Engineering/Programming and Operating Systems, Logics and Meanings of Programs, Computation by Abstract Devices, Programming Languages, Compilers, Interpreters, Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Foundations of Software Technology and Theoretical Computer Science

Editors:

Sections

Buy it now

Other ways to access

Table of contents (28 papers)

Front Matter

Program checking

Randomizing reductions of search problems

Time analysis, cost equivalence and program refinement

AC-equation solving

On the operational interpretation of complex types

Tense logics for local reasoning in distributed systems

Failures semantics for a simple process language with refinement

Correctness of programs over poor signatures

Complexity issues for vacillatory function identification

A purely algebraic proof of McNaughton's theorem on infinite words

The structure and complexity of minimal NFA's over a unary alphabet

Relativised cellular automata and complexity classes

Computing the order of a locally testable automaton

On the structure and complexity of infinite sets with minimal perfect hash functions

NP-hard sets and creativeness over constant time languages

Complete problems involving boolean labelled structures and projection translations

Is BP.⊕\(\mathcal{P}\)a probabilistic class?

Fast stable in-place sorting with O(n) data moves

A theorem on the approximation of set cover and vertex cover

Other Volumes