default search action
Information and Computation, Volume 86
Volume 86, Number 1, 1990
- Chein-I Chang, Simon C. Fan, Lee D. Davisson:
On Numerical Methods of Calculating the Capacity of Continuous-Input Discrete-Output Memoryless Channels. 1-13 - Deepak Kapur, Paliath Narendran, Friedrich Otto:
On Ground-Confluence of Term Rewriting Systems. 14-31 - Christopher J. Ash, Thomas Eric Hall, Jean-Eric Pin:
On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents. 32-42 - Paris C. Kanellakis, Scott A. Smolka:
CCS Expressions, Finite State Processes, and Three Problems of Equivalence. 43-68 - Jörg-Rüdiger Sack, Thomas Strothotte:
A Characterization of Heaps and Its Applications. 69-86 - Hans L. Bodlaender:
The Complexity of Finding Uniform Emulations on Paths and Ring Networks. 87-106 - Bruce E. Litow:
Parallel Complexity of the Regular Code Problem. 107-114
Volume 86, Number 2, 1990
- Andrea Asperti:
Stability and Computability in Coherent Domains. 115-139 - Greg N. Frederickson:
A Distributed Shortest Path Algorithm for a Planar Network. 140-159 - Eric Allender, Osamu Watanabe:
Kolmogorov Complexity and Degrees of Tally Sets. 160-178 - Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke:
On Measuring Nondeterminism in Regular Languages. 179-194 - Zoltán Fülöp, Sándor Vágvölgyi:
A Complete Rewriting System for a Monoid of Tree Transformation Classes. 195-212
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.