scientific article; zbMATH DE number 3943060
From MaRDI portal
Publication:3714484
Recommendations
- scientific article; zbMATH DE number 3856432
- On the decomposition of finite languages
- On languages of P automata
- scientific article; zbMATH DE number 4020506
- Finite automata and non-self-embedding grammars
- scientific article; zbMATH DE number 3894481
- scientific article; zbMATH DE number 3932372
- On deterministic finite automata and syntactic monoid size
- On deterministic finite automata and syntactic monoid size
- Regular separability of Parikh automata
Cited in
(7)- Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
- scientific article; zbMATH DE number 3856432 (Why is no real title available?)
- Improved bounds on the number of automata accepting finite languages
- On deterministic finite automata and syntactic monoid size
- Finite automata and non-self-embedding grammars
- On deterministic finite automata and syntactic monoid size
- On the separability of sparse context-free languages and of bounded rational relations
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 Q3714484)
