503 search results - page 34 / 101 » Probabilistic Weighted Automata |
123
click to vote
ATVA
2006
Springer
15 years 6 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
119
click to vote
FSMNLP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
103
click to vote
ENTCS
2008
15 years 3 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
109
click to vote
FOSSACS
2003
Springer
15 years 8 months ago
2003
Springer
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
114
click to vote
ECAL
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Self-replicating structures in cellular automata have been extensively studied in the past as models of Artificial Life. However, CAs, unlike the biological cellular mod...