Automata and Binary Decision Diagrams
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
The maximum state complexity for finite languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
On the average state and transition complexity of finite languages
Theoretical Computer Science
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
| Hi-index | 0.05 |