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.











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)