Sciweavers

415 search results - page 23 / 83
» Regular Processes and Timed Automata
Sort
View
ICGI
2004
Springer
14 years 2 months ago
Navigation Pattern Discovery Using Grammatical Inference
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...
Nikolaos Karampatziakis, Georgios Paliouras, Dimit...
ENTCS
2006
125views more  ENTCS 2006»
13 years 8 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
FLAIRS
2004
13 years 10 months ago
Cellular Automata Approach to Aircraft Corrosion Pit Growth
Corrosion is one of the degrading mechanisms that greatly affect the structural integrity of aerospace components. Corrosion begins with small imperfections in the given material ...
Ramana Pidaparti, Mathew J. Palakal, Long Fong
IJFCS
2008
130views more  IJFCS 2008»
13 years 8 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...
WIA
2004
Springer
14 years 2 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...