Sciweavers

759 search results - page 81 / 152
» Overlap-Free Regular Languages
Sort
View
CSL
2004
Springer
14 years 9 months ago
A Bounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
Mikolaj Bojanczyk
FSTTCS
2008
Springer
14 years 11 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
ICALP
2000
Springer
15 years 1 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
WWW
2003
ACM
15 years 10 months ago
Conversation specification: a new approach to design and analysis of e-service composition
This paper introduces a framework for modeling and specifying the global behavior of e-service compositions. Under this framework, peers (individual e-services) communicate throug...
Tevfik Bultan, Xiang Fu, Richard Hull, Jianwen Su
SIGMOD
2008
ACM
161views Database» more  SIGMOD 2008»
15 years 10 months ago
Efficient pattern matching over event streams
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Ne...