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:drops-oai.dagstuhl.de:10292

The Containment Problem for Unambiguous Register Automata

Authors
Publication date
1 January 2019
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Doi

    Abstract

    We investigate the complexity of the containment problem "Does L(A)subseteq L(B) hold?", where B is an unambiguous register automaton and A is an arbitrary register automaton. We prove that the problem is decidable and give upper bounds on the computational complexity in the general case, and when B is restricted to have a fixed number of registers

    Similar works

    Full text

    thumbnail-image

    Dagstuhl Research Online Publication Server

    redirect
    oaioai:drops-oai.dagstuhl.de:1029...
    Last time updated on 15/03/2019

    This paper was published in Dagstuhl Research Online Publication Server.

    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.