1728 search results - page 98 / 346 » The Size of Power Automata |
159
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The present paper surveys recent developments in algorithmic teaching. First, the traditional teaching dimension model is recalled. Starting from the observation that the...
153
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
190
click to vote
HYBRID
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
196
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
184
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 ...