On the number of initial segments of a finite set of sequences (finite language)

Karel Čulík; Antonín Vrba

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

The search session has expired. Please query the service again.

Displaying similar documents to “On the number of initial segments of a finite set of sequences (finite language)”

A contribution to the top-to-bottom recognizer rehabilitation

Jiří Kopřiva (1968)

Kybernetika

Similarity:

Efficient validation and construction of border arrays and validation of string matching automata

Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre (2009)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We present an on-line linear time and space algorithm to check if an integer array $f$ is the border array of at least one string $w$ built on a bounded or unbounded size alphabet $Σ$ . First of all, we show a bijection between the border array of a string $w$ and the skeleton of the DFA recognizing $Σ^{*} w$ , called a string matching automaton (SMA). Different strings can have the same border array but the originality of the presented method is that the correspondence between a border array and a skeleton...

Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time

Peter Růžička (1981)

Kybernetika

Similarity: