59 search results - page 5 / 12 » Simulations of Weighted Tree Automata |
161
Voted
QEST
2008
IEEE
16 years 24 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
165
Voted
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Background: Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined...
160
click to vote
CAI
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
183
click to vote
SIGCSE
1997
ACM
15 years 10 months ago
1997
ACM
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
192
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...