Sciweavers

Share
FOSSACS
2012
Springer
8 years 6 months ago
A Coalgebraic Perspective on Minimization and Determinization
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
Jirí Adámek, Filippo Bonchi, Mathias...
ATVA
2011
Springer
254views Hardware» more  ATVA 2011»
8 years 10 months ago
Formal Analysis of Online Algorithms
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
Benjamin Aminof, Orna Kupferman, Robby Lampert
ATVA
2011
Springer
213views Hardware» more  ATVA 2011»
8 years 10 months ago
Max and Sum Semantics for Alternating Weighted Automata
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
Shaull Almagor, Orna Kupferman
FSMNLP
2008
Springer
10 years 5 days ago
Learning with Weighted Transducers
Weighted finite-state transducers have been used successfully in a variety of natural language processing applications, including speech recognition, speech synthesis, and machine ...
Corinna Cortes, Mehryar Mohri
CSL
2008
Springer
10 years 15 days ago
Quantitative Languages
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
COLT
2003
Springer
10 years 4 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...
Mehryar Mohri
ICALP
2005
Springer
10 years 4 months ago
Weighted Automata and Weighted Logics
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
Manfred Droste, Paul Gastin
WIA
2007
Springer
10 years 4 months ago
Weighted Automata and Weighted Logics with Discounting
We introduce a weighted logic with discounting and we establish B¨uchi’s and Elgot’s theorem for weighted automata over finite words and arbitrary commutative semirings. The...
Manfred Droste, George Rahonis
RP
2009
Springer
124views Control Systems» more  RP 2009»
10 years 5 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez
FCT
2009
Springer
10 years 5 months ago
Alternating Weighted Automata
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
books