Pages that link to "Item:Q1115203"
From MaRDI portal
The following pages link to La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time) (Q1115203):
Displaying 4 items.
- Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) (Q1123986) (← links)
- Minimal automaton for a factorial, transitive, and rational language (Q1822985) (← links)
- Parsing with a finite dictionary (Q2484450) (← links)
- Automated pattern detection -- an algorithm for constructing optimally synchronizing multi-regular language filters (Q2503304) (← links)