Latent semantic analysis of game models using LSTM
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1231510 (Why is no real title available?)
- scientific article; zbMATH DE number 1241697 (Why is no real title available?)
- scientific article; zbMATH DE number 1342245 (Why is no real title available?)
- scientific article; zbMATH DE number 1058947 (Why is no real title available?)
- scientific article; zbMATH DE number 2090728 (Why is no real title available?)
- 10.1162/153244303322533223
- A system-level game semantics
- About the undecidability of program equivalence in finitary languages with state
- Angelic semantics of fine-grained concurrency
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Compositional Predicate Abstraction from Game Semantics
- Full abstraction for PCF
- Game semantics in the nominal model
- LCF considered as a programming language
- Learning register automata: from languages to program structures
- Nominal sets. Names and symmetry in computer science
- Novelty detection: a review. I. Statistical approaches
- Novelty detection: a review. II. Neural network based approaches
- On full abstraction for PCF: I, II and III
- Semantics of nondeterminism, concurrency, and communication
- Syntactic control of concurrency
- The denotational semantics of programming languages
- The regular-language semantics of second-order idealized ALGOL
- Third-order Idealized Algol with iteration is decidable
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(2)
This page was built for publication: Latent semantic analysis of game models using LSTM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423769)