scientific article; zbMATH DE number 1820028
From MaRDI portal
Publication:3152811
Cited in
(8)- On the Hopcroft's minimization technique for DFA and DFCA
- Descriptional complexity of regular languages
- On the descriptional complexity of Watson-Crick automata
- Transition complexity of language operations
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Hopcroft’s Minimization Technique: Queues or Stacks?
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
- Lower bounds for the transition complexity of NFAs
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 Q3152811)
