Skip to main content
Conference Proceedings

Descriptional complexity of nondeterministic finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4588 LNCS 31-35
DOI: 10.1007/978-3-540-73208-2_6
10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this talk, I will survey recent results and discuss open problems on the state and transition complexity of nondeterministic finite automata. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Salomaa, K. (2007). Descriptional complexity of nondeterministic finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4588 LNCS, pp. 31–35). Springer Verlag. https://doi.org/10.1007/978-3-540-73208-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free