Sciweavers

311 search results - page 6 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
LICS
2009
IEEE
14 years 2 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
Yang Cai, Ting Zhang, Haifeng Luo
EUROMICRO
2007
IEEE
13 years 9 months ago
Analysis of BPEL Data Dependencies
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The cur...
Yongyan Zheng, Jiong Zhou, Paul Krause
TCS
2010
13 years 2 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet
FORMATS
2009
Springer
14 years 2 months ago
On the Supports of Recognizable Timed Series
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
Karin Quaas
SYNTHESE
2008
177views more  SYNTHESE 2008»
13 years 7 months ago
On the role of language in social choice theory
Axiomatic characterization results in social choice theory are usually compared either regarding the normative plausibility or regarding the logical strength of the axioms involved...
Marc Pauly