Sciweavers

46 search results - page 2 / 10
» Strategical languages of infinite words
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 5 months ago
On Omega Context Free Languages which are Borel Sets of Infinite Rank
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
Olivier Finkel
ACL
2006
13 years 6 months ago
Phoneme-to-Text Transcription System with an Infinite Vocabulary
The noisy channel model approach is successfully applied to various natural language processing tasks. Currently the main research focus of this approach is adaptation methods, ho...
Shinsuke Mori, Daisuke Takuma, Gakuto Kurata
ENTCS
2006
122views more  ENTCS 2006»
13 years 4 months ago
Combining Aspect-Oriented and Strategic Programming
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
Karl Trygve Kalleberg, Eelco Visser
FSTTCS
2010
Springer
13 years 2 months ago
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
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...
Sven Schewe
FCT
2009
Springer
13 years 8 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas