Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems (Lecture Notes in Computer Science, Band 5955)

Computer Science
Wo zu kaufen (2) Eigenschaften
Gesponsert
Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems (Lecture Notes in Computer Science, Band 5955)
Medimops DE
53.49 EUR
Preis aktualisiert am: 13-06-2026 10:58:54
Siehe Produktangebot
Gesponsert
Automata for Branching and Layered Temporal Structures
SpringerLink DE
53.49 EUR
Preis aktualisiert am: 13-06-2026 18:30:19
Siehe Produktangebot

Allgemein

Marke
Springer

Eigenschaften

Ähnliche Produkte

Cellular Automata: 5th International Conference on Cellular Automata for Research and Industry, ACRI 2002 Geneva, Switzerland, October 9-11, 2002 ... Notes in Computer Science (2493), Band 2493)
Cellular Automata: 5th International Conference on Cellular Automata for Research and Industry, ACRI 2002 Geneva, Switzerland, October 9-11, 2002 ... Notes in Computer Science (2493), Band 2493)
Produkt anzeigen
Cellular Automata: Research Towards Industry: ACRI'98
Cellular Automata: Research Towards Industry: ACRI'98 - Proceedings of the Third Conference on Cellular Automata for Research and Industry, Trieste, 7-9 October 1998
Produkt anzeigen
Logics for Concurrency: Structure versus Automata (Lecture Notes in Computer Science (1043), Band 1043)
Logics for Concurrency: Structure versus Automata (Lecture Notes in Computer Science (1043), Band 1043)
Produkt anzeigen
ACRI '96. Proceedings of the second Conference on Cellular Automata for Research and Industry, Milan, Italy, 16-18 October 1996
ACRI '96. Proceedings of the second Conference on Cellular Automata for Research and Industry, Milan, Italy, 16-18 October 1996
Produkt anzeigen
A New Kind of Computational Biology
A New Kind of Computational Biology
Produkt anzeigen
An Efficient Finite Tree Automata Library: The Design of BDD-based Semi-symbolic Algorithms for Nondeterministic Finite Tree Automata
An Efficient Finite Tree Automata Library: The Design of BDD-based Semi-symbolic Algorithms for Nondeterministic Finite Tree Automata
Produkt anzeigen
Menü