Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFundamenta Informaticae, Volume 55
Volume 55, Number 1, 2003
- Stephen L. Bloom, Zoltán Ésik:
Deciding whether the frontier of a regular tree is scattered. 1-21 - Jean-Marc Champarnaud, Fabien Coulon:
Theoretical study and implementation of the canonical automaton. 23-38 - Liviu Petrisor Dinu:
On the Classification and Aggregation of Hierarchies with Different Constitutive Elements. 39-50 - Mikhail Ju. Moshkov:
Compressible Infinite Information Systems. 51-61 - Linh Anh Nguyen:
A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs. 63-100
Volume 55, Number 2, 2003
- Vladimir A. Bashkin, Irina A. Lomazova:
Petri nets and resource bisimulation. 101-114 - Marco Bellia, M. Eugenia Occhiuto:
N-axioms Parallel Unification. 115-128 - Berndt Farwer, Kundan Misra:
Modelling with Hierarchical Object Petri Nets. 129-147 - Krzysztof Pancerz, Zbigniew Suraj:
Synthesis of Petri Net Models: A Rough Set Approach. 149-165 - Wojciech Penczek, Alessio Lomuscio:
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking. 167-185 - Louchka Popova-Zeugmann, Matthias Werner, Jan Richling:
Using State Equation to Prove Non-Reachability in Timed Petrinets. 187-202 - Agata Pólrola, Wojciech Penczek, Maciej Szreter:
Reachability Analysis for Timed Automata Using Partitioning Algorithms. 203-221 - Bozena Wozna, Andrzej Zbrzezny, Wojciech Penczek:
Checking Reachability Properties for Timed Automata via SAT. 223-241
Volume 55, Numbers 3-4, 2003
- Suna Aydin, Henning Bordihn:
Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity. 243-254 - Gianpiero Cattaneo, Davide Ciucci:
Shadowed Sets and Related Algebraic Structures. 255-284 - Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc:
Deterministic Computations on a PRAM with Static Processor and Memory Faults. 285-306 - Cheng-Chi Lee, Wei-Pang Yang, Min-Shiang Hwang:
Untraceable Blind Signature Schemes Based on Discrete Logarithm Problem. 307-320 - Razvan Diaconescu:
Institution-independent Ultraproducts. 321-348 - Maciej Kandulski:
Derived Tree Languages of Nonassociative Lambek Categorial Grammars with Product. 349-362 - Sanjiang Li, Mingsheng Ying:
Extensionality of the RCC8 Composition Table. 363-385 - Karsten Weicker, Nicole Weicker:
Basic principles for understanding evolutionary algorithms. 387-403
a service of 
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.
last updated on 2024-04-25 05:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
