Probabilistic verification beyond context-freeness

Probabilistic verification beyond context-freeness

Pokaż inne wersje (1)

<p>Probability theory and probabilistic modelling have become indispensable across a wide range of scientific disciplines, with probabilistic programs emerging as a particularly flexible means of encoding sophisticated models in executable code. These programs, which merge traditional programm...

Szczegółowa specyfikacja

Opis bibliograficzny
1. autor:	Li, G
Kolejni autorzy:	Murawski, A
Format:	Praca dyplomowa
Język:	English
Wydane:	2024
Hasła przedmiotowe:	Theoretical computer science

Podobne zapisy

Probabilistic verification beyond context-freeness
od: Li, G, i wsp.
Wydane: (2022)

Evidence against the context-freeness of natural language /
od: 412590 Shieber, Stuart M.

The freeness of Ish arrangements
od: Takuro Abe, i wsp.
Wydane: (2015-01-01)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
od: Dino Mandrioli, i wsp.
Wydane: (2023-11-01)

Combinatorial proofs of freeness of some P-algebras
od: Vincent Vong
Wydane: (2015-01-01)

The freeness of ideal subarrangements of Weyl arrangements
od: Takuro Abe, i wsp.
Wydane: (2014-01-01)

Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness
od: Edward Bender, i wsp.
Wydane: (2012-01-01)

Electroactive polymer gels as probabilistic reservoir automata for computation
od: Vincent Strong, i wsp.
Wydane: (2022-12-01)

Asymptotic freeness in tracial ultraproducts
od: Cyril Houdayer, i wsp.
Wydane: (2024-01-01)

Freeness of Signed Graphic Arrangements
od: Zhaoting Ju, i wsp.
Wydane: (2024-03-01)

Supersolvability and Freeness for ψ-Graphical Arrangements
od: Mu, Lili, i wsp.
Wydane: (2016)

Envy-freeness in house allocation problems
od: Gan, J, i wsp.
Wydane: (2019)

On (non-) freeness of some tridendriform algebras
od: Vincent Vong
Wydane: (2020-04-01)

Optimistic and Pessimistic Result of Planning and Scheduling Dynamic Processes
od: Wieslaw Wajs
Wydane: (1999-01-01)

Normal Functions as a New Way of Defining Computable Functions
od: Leszek Dubiel
Wydane: (2004-01-01)

Generating Turing Machines by Use of Other Computation Models
od: Leszek Dubiel
Wydane: (2003-01-01)

Structural results for total search complexity classes with applications to game theory and optimisation
od: Hollender, A
Wydane: (2021)

The complexity of meta-computational problems
od: Rajgopal, N
Wydane: (2020)

The blind watchmaker network: scale-freeness and evolution.
od: Petter Minnhagen, i wsp.
Wydane: (2008-01-01)

Various Kinds of Freeness in the Categories of Krasner Hypermodules
od: Hossein Shojaei, i wsp.
Wydane: (2018-11-01)

Various Kinds of Freeness in the Categories of Krasner Hypermodules
od: Hossein Shojaei, i wsp.
Wydane: (2018-11-01)

Impossibility of Succinct Quantum Proofs for Collision-Freeness
od: Aaronson, Scott
Wydane: (2012)

Almost envy-freeness in group resource allocation
od: Kyropoulou, M, i wsp.
Wydane: (2019)

On learning assumptions for compositional verification of probabilistic systems
od: Feng, L
Wydane: (2014)

Aspects of beyond the Standard Model string phenomenology
od: Rosa, J, i wsp.
Wydane: (2010)

Dosimetric verification of clinical radiotherapy treatment planning system
od: Kolarević Goran, i wsp.
Wydane: (2022-01-01)

Games as mathematics of logic and computation
od: Yamada, N
Wydane: (2017)

STUDI KOMPUTASI KONFORMASI DAN PENGARUH PELARUT TERHADAP ENERGI INTERAKSI PADA KOMPLEKS YTTRIUM-DOTA- DENGAN METODE C-PCM (Conductor-like Polarizable Continuum Model)
od: ROZAQ, ABDUL
Wydane: (2012)

A Boolean model for conflict-freeness in argumentation frameworks
od: Jiachao Wu
Wydane: (2023-01-01)

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
od: Giorgio Bacci, i wsp.
Wydane: (2021-02-01)

A Model of Science to Base the Introduction of Aspects of Nature of Science in Teaching Contexts and to Analyse such Contexts
od: Monique Santos, i wsp.
Wydane: (2020-07-01)

Learning from Failure: Predicting Electronic Structure Calculation Outcomes with Machine Learning Models
od: Duan, Chenru, i wsp.
Wydane: (2020)

Solving the Trivial Crossing Problem While Preserving the Nodal Symmetry of the Wave Function
od: Lee, Elizabeth M. Y., i wsp.
Wydane: (2020)

Refinement and Difference for Probabilistic Automata
od: Benoît Delahaye, i wsp.
Wydane: (2014-08-01)

Towards formal verification of Bayesian inference in probabilistic programming via guaranteed bounds
od: Zaiser, F
Wydane: (2024)

Some counterexamples for (strong) persistence property and (nearly) normally torsion-freeness
od: Mehrdad Nasernejad
Wydane: (2023-11-01)

The Effect of Consistency and Freeness on the Yield Stress of Chemical Pulp Fibre Suspensions
od: Jiulong Sha, i wsp.
Wydane: (2015-05-01)

Synthesis from Probabilistic Components
od: Sumit Nain, i wsp.
Wydane: (2014-06-01)

Modelling Probabilistic Wireless Networks
od: Andrea Cerone, i wsp.
Wydane: (2013-09-01)

On Higher-Order Probabilistic Subrecursion
od: Flavien Breuvart, i wsp.
Wydane: (2021-12-01)