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:ddf074ed98004175b09494d229cddbcb

Representing a P-complete problem by small trellis automata

Authors
Publication date
1 June 2009
Publisher
'Open Publishing Association'
Doi

    Abstract

    A restricted case of the Circuit Value Problem known as the Sequential NOR Circuit Value Problem was recently used to obtain very succinct examples of conjunctive grammars, Boolean grammars and language equations representing P-complete languages (Okhotin, http://dx.doi.org/10.1007/978-3-540-74593-8_23 "A simple P-complete problem and its representations by language equations", MCU 2007). In this paper, a new encoding of the same problem is proposed, and a trellis automaton (one-way real-time cellular automaton) with 11 states solving this problem is constructed

    Similar works

    Full text

    thumbnail-image

    Directory of Open Access Journals

    redirect
    oaioai:doaj.org/article:ddf074ed9...
    Last time updated on 17/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.