default search action
Theoretical Computer Science, Volume 163
Volume 163, Numbers 1&2, 30 August 1996
- Bruno Courcelle:
Basic Notions of Universal Algebra for Language Theory and Graph Grammars. 1-54 - Stephen L. Bloom, Zoltán Ésik:
Free Shuffle Algebras in Language Varieties. 55-98 - Damian Niwinski, Igor Walukiewicz:
Games for the mu-Calculus. 99-116 - Livio Colussi, Laura Toniolo:
How the Character Comparison Order Shapes the Shift Function of On-Line Pattern Matching Algorithms. 117-144 - Denis Derencourt:
A Three-Word Code Which is Not Prefix-Suffix Composed. 145-160 - E. Hausen-Tropper:
A Framework for a Theory of Automated Learning. 161-176 - Richard Beigel, William I. Gasarch, Efim B. Kinber:
Frequency Computation and Bounded Queries. 177-192 - Siegfried Lehr, Jeffrey O. Shallit, John Tromp:
On the Vector Space of the Automatic Reals. 193-210 - Christos Levcopoulos, Ola Petersson:
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. 211-238 - Gu Xunrang, Zhu Yuzhang:
Optimal Heapsort Algorithm. 239-243 - Heribert Vollmer, Klaus W. Wagner:
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. 245-258 - Dongyang Long:
On Group Codes. 259-267 - Daniel Fredholm:
Computing Minimum with Primitive Recursion over Lists. 269-276 - Robert H. Gilman:
A Shrinking Lemma for Indexed Languages. 277-281 - Tatsuie Tsukiji:
On a Small Class of Boolean Sums. 283-289 - François Blanchard, Alejandro Maass:
Dynamical Behaviour of Coven's Aperiodic Cellular Automata. 291-302 - Rémy Malgouyres:
There is no Local Characterization of Separating and Thin Objects in Z³. 303-308 - Djelloul Ziadi:
Regular Expression for a Language without Empty Word. 309-315
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.