default search action
Theoretical Computer Science, Volume 178
Volume 178, Numbers 1-2, 30 May 1997
- Chia-Hsiang Chang, Robert Paige:
From Regular Expressions to DFA's Using Compressed NFA's. 1-36 - Peter Clote:
Nondeterministic Stack Register Machines. 37-76 - Gianpiero Cattaneo, C. Quaranta Vogliotti:
The "Magic" Rule Spaces of Neural-Like Elementary Cellular Automata. 77-102 - M. D. Atkinson, Mike Livesey, D. Tulley:
Permutations Generated by Token Passing in Graphs. 103-118 - Alix Munier, Claire Hanen:
Using Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays. 119-127 - Gregory Kucherov, Michaël Rusinowitch:
Matching a Set of Strings with Variable Length don't Cares. 129-154 - Martin Strauss:
Normal Numbers and Sources for BPP. 155-169 - Jean Berstel, Aldo de Luca:
Sturmian Words, Lyndon Words and Trees. 171-203 - Aldo de Luca:
Standard Sturmian Morphisms. 205-224 - Peter Damaschke:
An Optimal Parallel Algorithm for Digital Curve Segmentation. 225-236 - Anca Browne, Edmund M. Clarke, Somesh Jha, David E. Long, Wilfredo R. Marrero:
An Improved Algorithm for the Evaluation of Fixpoint Expressions. 237-255 - Peter M. Higgins:
A Proof on Simon's Theorem on Piecewise Testable Languages. 257-264 - Y. Kopidakis, Vassilis Zissimopoulos:
An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension. 265-273 - Michel Latteux, David Simplot:
Recognizable Picture Languages and Domino Tiling. 275-283
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.