|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 9 of 22 found articles
| Title: |
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism |
| Author: |
Salomaa, Arto |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 116 (2012) nr. 1-4 pages 237-249 |
| Year: |
2012-05-16 |
| Contents: |
We present schemes of deterministic finite automata such that, for every nontrivial automaton A resulting from the scheme with n states, the state complexity of the mirror image of the language L(A) equals 2n. The construction leads to cases, where the increase in complexity is maximal in the transition from nondeterministic devices to deterministic ones. We also discuss the crucial importance of the size of the alphabet and present some open problems. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 9 of 22 found articles
| << previous | next >> |