Sciweavers

19 search results - page 4 / 4
» Two-way finite automata with quantum and classical states
Sort
View
CORR
2011
Springer
222views Education» more  CORR 2011»
13 years 16 days ago
Generic Trace Logics
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
Christian Kissig, Alexander Kurz
ECAI
2008
Springer
13 years 7 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague
COR
2006
84views more  COR 2006»
13 years 5 months ago
Stability and interaction in flatline games
Starting from a given one-shot game played by a finite population of agents living in flatline, a circular or constrained grid structured by the classical definitions of neighborh...
Alexander Mehlmann
IWRIDL
2006
ACM
141views Education» more  IWRIDL 2006»
13 years 11 months ago
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
Gérard P. Huet