Sciweavers

426 search results - page 62 / 86
» Synchronization of Regular Automata
Sort
View
WIA
2004
Springer
14 years 1 months ago
Brute Force Determinization of NFAs by Means of State Covers
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
MM
2005
ACM
123views Multimedia» more  MM 2005»
14 years 1 months ago
How speech/text alignment benefits web-based learning
This demonstration presents an integrated web-based synchronized scenario for many-to-one cross-media correlations between speech (an EFL, English as Foreign Language, lecture wit...
Sheng-Wei Li, Hao-Tung Lin, Herng-Yow Chen
ICALP
1997
Springer
13 years 11 months ago
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
Olaf Burkart, Bernhard Steffen
COLING
2000
13 years 9 months ago
Modelling Speech Repairs in German and Mandarin Chinese Spoken Dialogues
Results presented in this paper strongly support the notion that similarities as well as differences in language systems can be empirically investigated by looking into the lingui...
Shu-Chuan Tseng
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere