Equations and regular-like expressions for afa
From MaRDI portal
Publication:4839734
Recommendations
- Alternating finite automata and star-free languages
- Efficient implementation of regular languages using reversed alternating finite automata
- Language equations for timed alternating finite automata
- scientific article; zbMATH DE number 1472276
- Nondeterministic regular expressions as solutions of equational systems.
Cites work
This page was built for publication: Equations and regular-like expressions for afa
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4839734)