2632 search results - page 140 / 527 » Alternating Timed Automata |
178
click to vote
HYBRID
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we investigate a new technique to determine whether an open continuous system behaves correctly for all admissible input signals. This technique is based on...
158
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
180
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechani...
142
click to vote
COLING
1996
15 years 7 months ago
1996
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
186
click to vote
ICGI
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...