Regular languages: to finite automata and beyond (invited talk)
From MaRDI portal
Publication:6587262
Recommendations
- scientific article; zbMATH DE number 7699973
- Descriptional complexity of regular languages
- Two-way finite automata: old and recent results
- More concise representation of regular languages by automata and regular expressions
- More Concise Representation of Regular Languages by Automata and Regular Expressions
This page was built for publication: Regular languages: to finite automata and beyond (invited talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587262)
