Foundations of software technology and theoretical computer science. 11th conference, held in New Delhi, India, December 17-19, 1991. Proceedings (Q1202025)

The articles of this volume will be reviewed individually. The preceding conference (10, 1990) has been reviewed (see Zbl 0731.00025). Indexed articles: \textit{Le Saëc, Bertrand; Pin, Jean-Eric; Weil, Pascal}, A purely algebraic proof of McNaughton's theorem of infinite words, 141-151 [Zbl 0925.68276] \textit{Jiang, Tao; McDowell, Edward; Ravikumar, B.}, The structure and complexity of minimal NFAs over a unary alphabet, 152-171 [Zbl 0925.68323] \textit{Mahajan, Meena; Krithivasan, Kamala}, Relativised cellular automata and complexity classes, 172-185 [Zbl 0925.68328] \textit{Kim, Sam; McNaughton, Robert}, Computing the order of a locally testable automaton, 186-211 [Zbl 0925.68321] \textit{Goldsmith, Judy; Hemachandra, Lane A.; Kunen, Kenneth}, On the structure and complexity of infinite sets with minimal perfect hash functions, 212-223 [Zbl 0925.68220] \textit{Agrawal, Manindra}, NP-hard sets and creativeness over constant time languages, 224-241 [Zbl 0925.03185] \textit{Stewart, Iain A.}, Complete problems involving Boolean labelled structures and projection translations, 242-260 [Zbl 0925.68186] \textit{Vinay, V.}, Is \(BP. \oplus P\) a probabilistic class?, 261-265 [Zbl 0925.68179] \textit{Paschos, V. Th.}, A theorem on the approximation of set cover and vertex cover, 278-287 [Zbl 0925.05043] \textit{Patkar, Sachin B.; Narayanan, H.}, A fast algorithm for the principal partition of a graph, 288-306 [Zbl 0925.05049] \textit{Fürer, Martin; Raghavachari, Balaji}, Contracting planar graphs efficiently in parallel, 319-335 [Zbl 0925.05054]