On Simple Stochastic Models

Ján Černý; Jan Vinař

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On Simple Stochastic Models”

Theory of stochastic automata

Peter H. Starke (1966)

Kybernetika

Similarity:

On the complexity of events recognizable in real time

Miloslav Nekvinda (1973)

Kybernetika

Similarity:

The factor automaton

Milan Šimánek (2002)

Kybernetika

Similarity:

This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.