644 search results - page 51 / 129 » Precedence Automata and Languages |
158
click to vote
ENTCS
2006
15 years 6 months ago
2006
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
177
click to vote
DLT
2007
15 years 7 months ago
2007
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
196
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
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 ...
172
click to vote
ENTCS
2002
15 years 6 months ago
2002
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
172
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...