


default search action
Theoretical Computer Science, Volume 25
Volume 25, 1983
- A. J. Kfoury:

Definability by Programs in First-Order Structures. 1-66 - Evelyn Nelson:

Iterative Algebras. 67-94 - Bruno Courcelle:

Fundamental Properties of Infinite Trees. 95-169 - Colm Ó'Dúnlaing:

Infinite Regular Thue Systems. 171-192 - John Case, Carl Smith:

Comparison of Identification Criteria for Machine Inductive Inference. 193-220 - Lutz Priese:

Automata and Concurrency. 221-265 - Robin Milner:

Calculi for Synchrony and Asynchrony. 267-310 - Rüdiger Valk:

Infinite Behaviour of Petri Nets. 311-341

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














