10493 search results - page 350 / 2099 » Dynamic Word Problems |
163
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...
205
click to vote
CONCUR
2012
Springer
13 years 9 months ago
2012
Springer
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
171
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust th...
162
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
This paper investigates a variety of statistical cache-based language models built upon three corpora: English, Lithuanian, and Lithuanian base forms. The impact of the cache size,...
213
click to vote
ALIFE
1998
15 years 6 months ago
1998
This article reports on the current state of our efforts to shed light on the origin and evolution of linguistic diversity using synthetic modeling and arti cial life es. We constr...