Filters








9,111 Hits in 1.5 sec

Probabilistic Tree Automata

Clarence A. Ellis
<span title="">1970</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the second annual ACM symposium on Theory of computing - STOC &#39;70</a> </i> &nbsp;
Tree Automata which characterize Probabilistic Context Free Languages.  ...  Probabilistic languages, along with related concepts of probabilistic grammars and probabilistic automata are defined, and a specific application of this theory is presented in the development of Probabilistic  ...  Third, the probabilistic concept is extended from finite automata to higher-level automata (such as probabilistic pushdown automata and probabilistic turing automata).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/800161.805165">doi:10.1145/800161.805165</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/Ellis70.html">dblp:conf/stoc/Ellis70</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/34ac7v3dpvforcnjsh63zqolyu">fatcat:34ac7v3dpvforcnjsh63zqolyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171005174901/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/f85/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxOTk5NTg3MTkwNjczNQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/79/f6/79f609985f0b3c3be17f728c2572cdccc2b5d10d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/800161.805165"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Probabilistic tree automata

Clarence A. Ellis
<span title="">1971</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
Tree Automata which characterize Probabilistic Context Free Languages.  ...  Probabilistic languages, along with related concepts of probabilistic grammars and probabilistic automata are defined, and a specific application of this theory is presented in the development of Probabilistic  ...  Third, the probabilistic concept is extended from finite automata to higher-level automata (such as probabilistic pushdown automata and probabilistic turing automata).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(71)90673-5">doi:10.1016/s0019-9958(71)90673-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2h4345tqwfbpdprpuerxgozpse">fatcat:2h4345tqwfbpdprpuerxgozpse</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171005174901/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/f85/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxOTk5NTg3MTkwNjczNQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/79/f6/79f609985f0b3c3be17f728c2572cdccc2b5d10d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(71)90673-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Ergodicity versus non-ergodicity for Probabilistic Cellular Automata on rooted trees [article]

Bruno Kimura, Wioletta Ruszel, Cristian Spitoni
<span title="2019-01-31">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this article we study a class of shift-invariant and positive rate probabilistic cellular automata (PCA) on rooted d-regular trees T^d.  ...  In a first result we extend the results of [10] on trees, namely we prove that to every stationary measure ν of the PCA we can associate a space-time Gibbs measure μ_ν on Z×T^d.  ...  We introduce indeed probabilistic cellular automata on d-ary trees V = , we naturally define their sum i + j as the concatenation of these sequences, i.e., the sum is the element of {0, . . . , d − 1}  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1710.00084v2">arXiv:1710.00084v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qazdhejszvhxxkfl2ox7bdq63y">fatcat:qazdhejszvhxxkfl2ox7bdq63y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200914224154/https://arxiv.org/pdf/1710.00084v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cf/bc/cfbc9ccd0006321ea7618a014aa23ccfe036aa17.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1710.00084v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Quasi-Birth–Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ie2sxzzlsraaroxezes23o7rs4" style="color: black;">Performance evaluation (Print)</a> </i> &nbsp;
We begin by observing that (discrete-time) Quasi-Birth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and both Tree-Like QBDs (TL-QBDs  ...  ) and Tree-Structured QBDs (TS-QBDs) are equivalent to both probabilistic Pushdown Systems (pPDSs) and Recursive Markov Chains (RMCs).  ...  Probabilistic 1-Counter Automata have not yet been extensively studied in the literature on model checking and verification.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.peva.2009.12.009">doi:10.1016/j.peva.2009.12.009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xe5gyczdmrcxje7laareewnc6m">fatcat:xe5gyczdmrcxje7laareewnc6m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815122524/https://www.era.lib.ed.ac.uk/bitstream/handle/1842/2152/qest08-tech-report_6_27.pdf?sequence=3" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/15/06/15063fe9c0f2b346e128b5645922477f2b4b03c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.peva.2009.12.009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mr2re5en4rajnjdlytdvj35iyy" style="color: black;">2008 Fifth International Conference on Quantitative Evaluation of Systems</a> </i> &nbsp;
We begin by observing that (discrete-time) Quasi-Birth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and both Tree-Like QBDs (TL-QBDs  ...  ) and Tree-Structured QBDs (TS-QBDs) are equivalent to both probabilistic Pushdown Systems (pPDSs) and Recursive Markov Chains (RMCs).  ...  Probabilistic 1-Counter Automata have not yet been extensively studied in the literature on model checking and verification.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/qest.2008.35">doi:10.1109/qest.2008.35</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/qest/EtessamiWY08.html">dblp:conf/qest/EtessamiWY08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n44ppc4xprfz5gbshprtk4ac34">fatcat:n44ppc4xprfz5gbshprtk4ac34</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815122524/https://www.era.lib.ed.ac.uk/bitstream/handle/1842/2152/qest08-tech-report_6_27.pdf?sequence=3" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/15/06/15063fe9c0f2b346e128b5645922477f2b4b03c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/qest.2008.35"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 731 of Mathematical Reviews Vol. 52, Issue 2 [page]

<span title="">1976</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The author announces a number of results on probabilistic tree automata.  ...  The author introduces an extension of probabilistic automata, called evolution dependent automata.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1976-08_52_2/page/731" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1976-08_52_2/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Alternating Tree Automata with Qualitative Semantics [article]

Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
<span title="2020-12-07">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
automata with non-zero semantics, a recently introduced probabilistic model of alternating tree automata.  ...  We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative  ...  Probabilistic Automata on Infinite Trees with alitative Semantics Probabilistic tree automata with qualitative semantics were defined in [8] with the intention of lifting the definition of probabilistic  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2002.03664v2">arXiv:2002.03664v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cq5cdku5rbd5thg6e42wkhgycu">fatcat:cq5cdku5rbd5thg6e42wkhgycu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201209054959/https://arxiv.org/pdf/2002.03664v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/67/0f/670f6e11b8d61440edb9eb12be529e5b49549e88.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2002.03664v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Alternating Tree Automata with Qualitative Semantics

Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
<span title="2020-12-17">2020</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3kjjbv4edjbezl2w37ipy5lo5a" style="color: black;">ACM Transactions on Computational Logic</a> </i> &nbsp;
automata with non-zero semantics, a recently introduced probabilistic model of alternating tree automata.  ...  We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative  ...  Probabilistic Automata on Infinite Trees with Qualitative Semantics Probabilistic tree automata with qualitative semantics were defined in [8] with the intention of lifting the definition of probabilistic  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3431860">doi:10.1145/3431860</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rrr4up5tiza6zjbce3zvrbqvbe">fatcat:rrr4up5tiza6zjbce3zvrbqvbe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210429125333/https://hal.archives-ouvertes.fr/hal-02533936/file/2021tocl.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ee/14/ee14ed09de2e583eb91fcaac0e82d68aae815009.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3431860"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable [article]

Raphaël Berthon, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Jean-François Raskin, Sasha Rubin
<span title="2019-02-15">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
To do this we prove that the emptiness problem of qualitative universal parity tree automata is undecidable.  ...  This quantifier says that the set of infinite paths in the tree that satisfies some formula has Lebesgue-measure one.  ...  Probabilistic tree automata We now recall the probabilistic tree automata introduced in [7] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.04349v5">arXiv:1901.04349v5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jevgbs6pd5fo3k6alamv4uchty">fatcat:jevgbs6pd5fo3k6alamv4uchty</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905203040/https://arxiv.org/pdf/1901.04349v5.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/93/c0/93c09081339d70600d2498e1a42184ea79331097.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.04349v5" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Compositional Temporal Synthesis

Moshe Y. Vardi
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mr2re5en4rajnjdlytdvj35iyy" style="color: black;">2012 Ninth International Conference on Quantitative Evaluation of Systems</a> </i> &nbsp;
Automata-Theoretic Approach Key Idea of Temporal Synthesis: • Use tree automata to accept "good" strategy trees • Use word automata to accept "good" tree branches V.  ...  +Wolper, 1983: Elementary (exponential) translation from LTL to automata. • Safra, 1988: Doubly exponential construction of tree automata for strategy trees wrt LTL spec (using V.  ...  Controlflow Composition Questions: • If components are probabilistic why not allow probabilistic controlflow? • Is probabilistic controlflow more powerful than deterministic controlflow?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/qest.2012.39">doi:10.1109/qest.2012.39</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/qest/Vardi12.html">dblp:conf/qest/Vardi12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ytzkyl2argdfndnm44zkoly4m">fatcat:7ytzkyl2argdfndnm44zkoly4m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190610200714/https://excape.cis.upenn.edu/documents/MosheVardi.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/bf/d8bf599e70567afa8259af7173c48431914d8326.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/qest.2012.39"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 1787 of Mathematical Reviews Vol. 47, Issue 6 [page]

<span title="">1974</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Probabilistic tree automata. Information and Control 19 (1971), 401-416.  ...  to probabilistic automata.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1974-06_47_6/page/1787" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1974-06_47_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 4191 of Mathematical Reviews Vol. , Issue 2001F [page]

<span title="">2001</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
We defined and studied probabilistic Biichi automata [“A decomposition theorem for probabilistic Bichi automata”, in Zilele Academice Timisene (Timisoara, 1997); per bibl.; “Probabilistic au- tomata over  ...  Paz [Introduction to probabilistic automata, Academic Press, New York, 1971; MR 44 #6417].  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2001-06_2001f/page/4191" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2001-06_2001f/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Alternative approaches for generating bodies of grammar rules

Gabriel Infante-Lopez, Maarten de Rijke
<span title="">2004</span> <i title="Association for Computational Linguistics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5n6volmnonf5tn6xputi5f2t3e" style="color: black;">Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL &#39;04</a> </i> &nbsp;
We compare the two approaches along two dimensions: the quality of the probabilistic regular language they produce, and the performance of the parser they were used to build.  ...  In today's parsers rule bodies do not exist a priori but are generated on the fly, usually with methods based on n-grams, which are one particular way of inducing probabilistic regular languages.  ...  In particular, the use of n-grams implies that the solution will be searched for in the class of probabilistic regular languages, since n-grams induce probabilistic automata and, consequently, probabilistic  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3115/1218955.1219013">doi:10.3115/1218955.1219013</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/acl/LopezR04.html">dblp:conf/acl/LopezR04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/psnodjlos5dgbfc7eu3vqxwhmi">fatcat:psnodjlos5dgbfc7eu3vqxwhmi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705162227/http://aclweb.org/anthology//P/P04/P04-1058.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/64/2c/642c9cdb41338e18582ebeafed0c4b60a16217df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3115/1218955.1219013"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Compositionality for Probabilistic Automata [chapter]

Nancy Lynch, Roberto Segala, Frits Vaandrager
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We establish that on the domain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder.  ...  Tree-structured probabilistic automata: The unfolding of a probabilistic automaton P, denoted by Unfold (P), is the tree-structured probabilistic automaton Q obtained from P by unfolding its transition  ...  Tree-structured automata: An automaton is tree-structured if each state is reached via a unique execution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45187-7_14">doi:10.1007/978-3-540-45187-7_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2hske7zjdfgffasefq2xjht554">fatcat:2hske7zjdfgffasefq2xjht554</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809022425/http://www.mbsd.cs.ru.nl/publications/papers/fvaan/cpa.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0a/4c/0a4c37970851b539714a4e9b996f94537d46d7f0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45187-7_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Properties of probabilistic pushdown automata

Ioan I. Macarie, Mitsunori Ogihara
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Properties of' (unbounded-error) probabilistic as well as "probabilistic plus nondeterministic" pushdown automata and auxiliary pushdown automata are studied.  ...  with probabilistic states and with "probabilistic plus nondeterministic" states.  ...  probabilistic pushdown automata [7] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(98)00059-0">doi:10.1016/s0304-3975(98)00059-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wblsfvu4urfxhj4p2vz3pjopiy">fatcat:wblsfvu4urfxhj4p2vz3pjopiy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170925010956/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/1f5/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzU5ODAwMDU5MA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/bc/b5bc60e1944b5c3c3179bde7f5c54e0fc8725945.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(98)00059-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 9,111 results