scientific article; zbMATH DE number 7699973
From MaRDI portal
Publication:6100191
Recommendations
- Descriptional complexity of regular languages
- More Concise Representation of Regular Languages by Automata and Regular Expressions
- More concise representation of regular languages by automata and regular expressions
- Descriptional complexity -- an introductory survey
- Descriptional and computational complexity of finite automata -- a survey
Cited in
(14)- Simulating finite automata with context-free grammars.
- Descriptional complexity of regular languages
- From two-way to one-way finite automata -- three regular expression-based methods
- Descriptional complexity -- an introductory survey
- Concise representations of regular languages by degree and probabilistic finite automata
- More Concise Representation of Regular Languages by Automata and Regular Expressions
- scientific article; zbMATH DE number 1773094 (Why is no real title available?)
- scientific article; zbMATH DE number 6136496 (Why is no real title available?)
- Recent trends in descriptional complexity of formal languages
- scientific article; zbMATH DE number 7438576 (Why is no real title available?)
- scientific article; zbMATH DE number 5218131 (Why is no real title available?)
- Regular languages of nested words: fixed points, automata, and synchronization
- Regular languages: to finite automata and beyond (invited talk)
- More concise representation of regular languages by automata and regular expressions
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 Q6100191)
