


default search action
Theoretical Computer Science, Volume 366
Volume 366, Numbers 1-2, November 2006
- José Luiz Fiadeiro, Jan J. M. M. Rutten:
Preface. 1-2
- Stefan Milius, Lawrence S. Moss:
The category-theoretic solution of recursive program schemes. 3-59
- Luca Aceto, Wan J. Fokkink
, Anna Ingólfsdóttir, Sumit Nain:
Bisimilarity is not finitely based over BPA with interrupt. 60-81 - Jirí Adámek:
The intersection of algebra and coalgebra. 82-97 - Roberto Bruni
, Ivan Lanese
, Ugo Montanari:
A basic algebra of stateless connectors. 98-120 - Daniel Hausmann, Till Mossakowski
, Lutz Schröder
:
A coalgebraic approach to the semantics of the ambient calculus. 121-143 - Martin Hyland, John Power
:
Discrete Lawvere theories and computational effects. 144-162 - Prasanna Thati, José Meseguer:
Complete symbolic reachability analysis using back-and-forth narrowing. 163-179
Volume 366, Number 3, November 2006
- Zoltán Ésik:
Preface. 181
- Michael Domaratzki
, Kai Salomaa:
Codes defined by multiple sets of trajectories. 182-193 - Pál Dömösi, Géza Horváth:
Alternative proof of the Lyndon-Schützenberger Theorem. 194-198 - Manfred Droste, Dietrich Kuske:
Skew and infinitary formal power series. 199-227 - Manfred Droste, Heiko Vogler:
Weighted tree automata and weighted logics. 228-247 - Andreas Maletti:
Compositions of tree series transformations. 248-271 - Frantisek Mráz
, Friedrich Otto, Martin Plátek
, Tomasz Jurdzinski:
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. 272-296 - Bianca Truthe
:
The finiteness of synchronous, tabled picture languages is decidable. 297-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.