MacFAUST : program for constructing finite automata as instruments in problem solving research ; manual
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
48 S.
- Sprache
-
Deutsch
- Erschienen in
-
Berichte aus dem Psychologischen Institut der Universität Bonn / Psychologisches Institut ; Bd. 17, H. 3
- Ereignis
-
Veröffentlichung
- (wo)
-
Bonn
- (wer)
-
Psychologisches Inst.
- (wann)
-
1991
- Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 12:12 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Buchner, Axel
- Psychologisches Inst.
Entstanden
- 1991
Ähnliche Objekte (12)
Learning probabilistic automata with SMT solving
Constructing Deterministic Parity Automata from Positive and Negative Examples
Finite state automata: Dynamic task environments in problem solving research.
Constructing a Static Program Slicer for R Programs
Solving Language Equations and Disequations Using Looping Tree Automata with Colors
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Relational Reasoning - Constraint Solving, Deduction, and Program Verification
A WINDOWS program : constructing objective functions ; version 1.0 user's guide
Temporal Program Verification and Synthesis as Horn Constraints Solving
Fractals in science : with a MacIntosh program Diskette
Constructing paradise
Learning probabilistic automata with SMT solving
Constructing Deterministic Parity Automata from Positive and Negative Examples
Finite state automata: Dynamic task environments in problem solving research.
Constructing a Static Program Slicer for R Programs
Solving Language Equations and Disequations Using Looping Tree Automata with Colors
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Relational Reasoning - Constraint Solving, Deduction, and Program Verification
A WINDOWS program : constructing objective functions ; version 1.0 user's guide
Temporal Program Verification and Synthesis as Horn Constraints Solving
Fractals in science : with a MacIntosh program Diskette
Constructing paradise
Learning probabilistic automata with SMT solving
Constructing Deterministic Parity Automata from Positive and Negative Examples
Finite state automata: Dynamic task environments in problem solving research.
Constructing a Static Program Slicer for R Programs
Solving Language Equations and Disequations Using Looping Tree Automata with Colors
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Relational Reasoning - Constraint Solving, Deduction, and Program Verification
A WINDOWS program : constructing objective functions ; version 1.0 user's guide
Temporal Program Verification and Synthesis as Horn Constraints Solving
Fractals in science : with a MacIntosh program Diskette