Design of Sequential Machines from Their Regular Expressions
From MaRDI portal
Cited in
(5)- A mesh of automata
- From finite automata to regular expressions and back -- a summary on descriptional complexity
- On average behaviour of regular expressions in strong star normal form
- Construction of recognition devices for regular languages from their Backus Normal Form definition
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
This page was built for publication: Design of Sequential Machines from Their Regular Expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5557945)