Sciweavers

815 search results - page 13 / 163
» Algebraic Recognizability of Languages
Sort
View
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
15 years 3 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...
79
Voted
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
82
Voted
JUCS
2002
108views more  JUCS 2002»
14 years 9 months ago
Heyting Algebras and Formal Languages
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
Werner Kuich, Norbert Sauer, Friedrich J. Urbanek
62
Voted
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...