scientific article; zbMATH DE number 4001511
From MaRDI portal
Publication:4728283
[For the entire collection see Zbl 0593.00024.] In this paper we give a formalism for the definition of finite languages which allows us to construct recognizers automatically. Then we study some properties of the defined languages and finally we describe a very fast recognizer for a particular class of languages.
Recommendations
- Languages recognized by a class of finite automata
- scientific article; zbMATH DE number 4074516
- 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)
- Two-dimensional cellular automata recognizer
- scientific article; zbMATH DE number 4072418
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728283)