## Foundations of software technology and theoretical computer science: tenth conference, Bangalore, India, December 17-19, 1990 : proceedingsThis volume gives the proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science. These conferences are organized and run by the computer science research community in India, and their purpose is to provide a forum for professional interaction between members of this research community and their counterparts in different parts of the world. The volume includes four invited papers on: - reasoning about linear constraints using parametric queries, - the parallel evaluation of classes of circuits, - a theory of commonsense visual reasoning, - natural language processing, complexity theory and logic. The 26 submitted papers are organized into sections on logic, automata and formal languages, theory of programming, parallel algorithms, geometric algorithms, concurrency, distributed computing, and semantics. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

R K Shyamasundar TIFR Bombay | 1 |

G Venkatesh IIT Bombay | 21 |

Complexity of Algebraic Specifications | 33 |

Copyright | |

14 other sections not shown

### Other editions - View all

### Common terms and phrases

abstract automata auxiliary variables bisimulation bound cograph complete Computer Science concurrent configuration consider constraints construction contains corresponding defined definition denotational semantics denote elements empty equational equivalent euclidean n-space example exists expression finite formula function symbols given graph hypercube induction infinite trees initial algebra input integer interpretation isomorphism isothetic polygon language lattice Lemma linear logic MER's module multiset node observation operations optimal pair parallel algorithm parameters partial ordering partition path polygon polynomial Post's Correspondence Problem predicate prefix sum problem process fairness processors proof properties prove pseudo-copy query rectangle recursive relation representation represented reset result rules semantics sequence simulation solid block sorting stable model semantics staircase step strings structure subset subterm subtree Theorem theory transition system tree automaton Univ vector vertex vertices visual VLSI Vor(S Voronoi Voronoi diagram window