Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:doaj.org/article:11970396068849bbb34e6bcd95e00306

Transition Complexity of Incomplete DFAs

Authors
Publication date
1 August 2010
Publisher
'Open Publishing Association'
Doi

    Abstract

    In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been obtained. It is shown that the transition complexity results for union and complementation are very different from the state complexity results for the same operations. However, for intersection, the transition complexity result is similar to that of state complexity

    Similar works

    Full text

    thumbnail-image

    Directory of Open Access Journals

    redirect
    oaioai:doaj.org/article:119703960...
    Last time updated on 18/12/2014

    This paper was published in Directory of Open Access Journals.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.