default search action
Theoretical Computer Science, Volume 27
Volume 27, 1983
- Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. 3-38 - Tsutomu Kamimura, Adrian Tang:
Algebraic Relations and Presentations. 39-60 - Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
Two-Dimensional Alternating Turing Machines. 61-83 - Grzegorz Rozenberg, R. Verraedt:
Subset Languages of Petri Nets Part II: Closure Properties. 85-108 - Michael B. Smyth:
The Largest Cartesian Closed Category of Domains. 109-119 - Pavol Duris, Juraj Hromkovic:
One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. 121-125 - Joseph Y. Halpern, John H. Reif:
The Propositional Dynamic Logic of Deterministic, Well-Structured Programs. 127-165 - Hans-Dieter Ehrich, Udo W. Lipeck:
Algebraic Domain Equations. 167-196 - Alexei P. Stolboushkin, Michael A. Taitslin:
The Comparison of the Expressive Power of First-Order Dynamic Logics. 197-209 - Symeon Bozapalidis, Olympia Louscou-Bozapalidou:
The Rank of a Formal Tree Power Series. 211-215 - Akira Maruoka:
Open Maps for Tessellation Automata. 217-224 - Jirí Adámek, Evelyn Nelson:
Separately Continuous Algebras. 225-231 - David P. Dobkin, David G. Kirkpatrick:
Fast Detection of Polyhedral Intersection. 241-253 - Hartmut Ehrig, Hans-Jörg Kreowski:
Compatibility of Parameter Passing and Implementation of Parameterized Data Types. 255-286 - Norbert Blum:
More on the Power of Chain Rules in Context-Free Grammars. 287-295 - Robert D. Tennent:
Semantics of Interference Control. 297-310 - Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg:
On Regularity of Context-Free Languages. 311-332 - Dexter Kozen:
Results on the Propositional mu-Calculus. 333-354
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.