Theoretical Computer Science
, Volume 80
Volume 80, Number 1, 1991
Wolfgang Reisig
: Petri Nets and Algebraic Specifications. 1-34
BibTeX
Ferenc Gécseg
,
Helmut Jürgensen
: On alpha-0-nu-1-Products of Automata. 35-51
BibTeX
Stephan Heilbrunner
,
Lothar Schmitz
: An Efficient Recognizer for the Boolean Closure of Context-Free Languages. 53-75
BibTeX
Rodney R. Howell
,
Louis E. Rosier
,
Hsu-Chun Yen
: Global and Local Views of State Fairness. 77-104
BibTeX
Patrick Powell
,
Viet Ngo
: Complexity of Optimal Vector Code Generation. 105-115
BibTeX
Gerhard Hofer
: Experiments and Stability in Group Automata. 117-120
BibTeX
Volume 80, Number 2, 1991
Hajnal Andréka
,
István Németi
,
Ildikó Sain
: On the Strength of Temporal Proofs. 125-151
BibTeX
Bruno Courcelle
: The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability. 153-202
BibTeX
Lane A. Hemachandra
,
Albrecht Hoene
,
Dirk Siefkes
,
Paul Young
: On Sets Polynomially Enumerable by Iteration. 203-225
BibTeX
Sebastian Iwanowski
: Testing Approximate Symmetry in the Plane is NP-Hard. 227-262
BibTeX
Ernst-Rüdiger Olderog
: Correctness of Concurrent Processes. 263-288
BibTeX
Desh Ranjan
,
Richard Chang
,
Juris Hartmanis
: Space Bounded Computations: Review and New Separation Results. 289-302
BibTeX
Bernhard Steffen
,
Jens Knoop
: Finite Constants: Characterizations of a New Decidable Set of Constants. 303-318
BibTeX
Danuta Szczepanska
: A Hoare-Like Verification System for a Language with an Exception Handling Mechanism. 319-335
BibTeX
Juraj Wiedermann
: On the Computational Efficiency of Symmetric Neural Networks. 337-345
BibTeX
Copyright ©
Sun May 17 00:24:03 2009 by
Michael Ley
(
ley@uni-trier.de
)