Informatique Théorique et Applications, Volume 37, 2003
Volume 37, Number 1, January-March 2003
Ludwik Czaja:
On the Analysis of Petri Nets and their Synthesis from Process Languages. 17-38 Beate Bollig:
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs. 51-66 Victor L. Selivanov:
Wadge Degrees of [omega]-Languages of Deterministic Turing Machines. 67-83 Gwénaël Richomme:
Some algorithms to compute the conjugates of Episturmian morphisms. 85-104
Volume 37, Number 2, April-June 2003
Olivier Finkel:
On the Topological Complexity of Infinitary Rational Relations. 105-113 Olivier Finkel:
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations. 115-126 Juha Honkala:
A bound for the [omega]-equivalence problem of polynomial D0L systems. 149-157 Norbert Popély:
The Communication Hierarchy of Time and Space Bounded Parallel Machines. 159-176
Volume 37, Number 3, July-September 2003
Michal Kunc:
Equational description of pseudovarieties of homomorphisms. 243-254 Ján Manuch,
Ladislav Stacho:
On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. 255-270
Volume 37, Number 4, October-December 2003
Special Issue:
Fixed Points in Computer Science (FICS'02)
maintained by
at
Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-26 21:43 CEST by the dblp team