Current Trends in Theoretical Computer Science (Q4820374)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2107970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Current Trends in Theoretical Computer Science |
scientific article; zbMATH DE number 2107970 |
Statements
Current Trends in Theoretical Computer Science (English)
0 references
14 October 2004
0 references
The articles of this volume will be reviewed individually. Indexed articles: \textit{Ehrig, Hartmut; Schröter, Gunnar}, The role of mathematics and formal specification techniques in software system development, 5-14 [Zbl 1063.68604] \textit{Fischer, Clemens; Wehrheim, Heike}, Failure-divergence semantics as a formal basis for an object-oriented integrated formal method, 15-26 [Zbl 1063.68070] \textit{Ehrig, Hartmut}, Bigraphs meet double pushouts, 27-40 [Zbl 1063.68072] \textit{Qemali, Anilda}, A new experience with graph transformation, 41-46 [Zbl 1100.68596] \textit{de Lara, Juan}, Meta-modelling and graph transformation for the simulation of systems, 47-62 [Zbl 1063.68063] \textit{Urbášek, Milan}, Net transformations for Petri net technology, 63-87 [Zbl 1063.68074] \textit{Ehrig, Hartmut}, On the relevance of high-level net processes, 89-93 [Zbl 1063.68608] \textit{Blass, Andreas; Gurevich, Yuri}, A new zero-one law and strong extension axioms, 99-118 [Zbl 1063.03532] \textit{Flum, Jörg}, Tree-decompositions and the model-checking problem, 119-139 [Zbl 1063.68056] \textit{Ferbus-Zanda, Marie; Grigorieff, Serge}, Is randomness ``native'' to computer science?, 141-179 [Zbl 1063.68592] \textit{Shilov, Nikolay V.; Yi, Kwang}, How to find a coin: propositional program logics made easy, 181-213 [Zbl 1063.68043] \textit{Blass, Andreas; Gurevich, Yuri}, Algorithms vs. machines, 215-236 [Zbl 1065.68051] \textit{Blass, Andreas; Gurevich, Yuri}, Pairwise testing, 237-266 [Zbl 1065.68032] \textit{Bezem, Marc; Coquand, Thierry}, Newman's lemma -- a case study in proof automation and geometric logic, 267-282 [Zbl 1063.68089] \textit{Blass, Andreas; Gurevich, Yuri}, Algorithms: a quest for absolute definitions, 283-311 [Zbl 1065.68052] \textit{Aceto, Luca}, Some of my favourite results in classic process algebra, 317-335 [Zbl 1063.68607] \textit{Srba, Jiří}, Roadmap of infinite results, 337-350 [Zbl 1065.68073] \textit{Hermanns, Holger}, Construction and verification of concurrent performance and reliability models, 351-375 [Zbl 1065.68069] \textit{Panangaden, Prakash}, Does combining nondeterminism and probability make sense?, 377-384 [Zbl 1063.68665] \textit{Sassone, Vladimiro}, The algebraic structure of Petri nets, 385-410 [Zbl 1065.68072] \textit{Berstel, Jean; Karhumäki, Juhani}, Combinatorics on words -- a tutorial, 415-475 [Zbl 1065.68078] \textit{Karhumäki, Juhani; Petre, Ion}, Two problems on commutation of languages, 477-493 [Zbl 1065.68079] \textit{Salomaa, Arto}, Counting (scattered) subwords, 495-510 [Zbl 1076.68057] \textit{Halava, Vesa; Harju, Tero}, Post correspondence problem -- recent results, 511-531 [Zbl 1135.03339] \textit{Honkala, Juha}, The DF0L language equivalence problem, 533-543 [Zbl 1065.68059] \textit{Okhotin, Alexander}, On overview of conjunctive grammars, 545-566 [Zbl 1065.68058] \textit{Yu, Sheng}, State complexity of finite and infinite regular languages, 567-579 [Zbl 1063.68596] \textit{Martín-Vide, Carlos; Mateescu, Alexandru}, GSMs and contexts, 581-587 [Zbl 1065.68061] \textit{Salomaa, Arto}, The depth of functional compositions, 589-598 [Zbl 1076.68042] \textit{Martín-Vide, Carlos; Păun, Gheorghe}, Language generating by means of membrane systems, 599-611 [Zbl 1065.68062] \textit{Martín-Vide, Carlos; Păun, Andrei; Păun, Gheorghe}, Membrane computing: new results, new problems, 613-623 [Zbl 1063.68587]
0 references