Sciweavers

3653 search results - page 8 / 731
» On Recognizable Timed Languages
Sort
View
STACS
2004
Springer
15 years 3 months ago
Desert Automata and the Finite Substitution Problem
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
Daniel Kirsten
95
Voted
ITA
2000
14 years 9 months ago
Iteration of rational transductions
The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of tr...
Alain Terlutte, David Simplot
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
15 years 4 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
15 years 1 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe
LRE
2006
99views more  LRE 2006»
14 years 9 months ago
A lexicon for Vietnamese language processing
Only very recently have Vietnamese researchers begun to be involved in the domain of Natural Language Processing (NLP). As there does not exist any published work in formal linguis...
Thi Minh Huyen Nguyen, Laurent Romary, Mathias Ros...