Rice Univesrity Logo
    • FAQ
    • Deposit your work
    • Login
    View Item 
    •   Rice Scholarship Home
    • Faculty & Staff Research
    • Faculty Publications
    • View Item
    •   Rice Scholarship Home
    • Faculty & Staff Research
    • Faculty Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Regular Real Analysis

    Thumbnail
    Name:
    lics13a.pdf
    Size:
    381.8Kb
    Format:
    PDF
    View/Open
    Author
    Chaudhuri, Swarat; Sankaranarayanan, Sriram; Vardi, Moshe Y.
    Date
    2013
    Abstract
    We initiate the study of regular real analysis, or the analysis of real functions that can be encoded by automata on infinite words. It is known that ω-automata can be used to represent {relations} between real vectors, reals being represented in exact precision as infinite streams. The regular functions studied here constitute the functional subset of such relations. We show that some classic questions in function analysis can become elegantly computable in the context of regular real analysis. Specifically, we present an automata-theoretic technique for reasoning about limit behaviors of regular functions, and obtain, using this method, a decision procedure to verify the continuity of a regular function. Several other decision procedures for regular functions-for finding roots, fix points, minima, etc.-are also presented. At the same time, we show that the class of regular functions is quite rich, and includes functions that are highly challenging to encode using traditional symbolic notation.
    Citation
    Chaudhuri, Swarat, Sankaranarayanan, Sriram and Vardi, Moshe Y.. "Regular Real Analysis." LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (2013) Association for Computing Machinery: 509-518. http://dx.doi.org/10.1109/LICS.2013.57.
    Published Version
    http://dx.doi.org/10.1109/LICS.2013.57
    Type
    Conference paper
    Publisher
    Association for Computing Machinery
    Citable link to this page
    https://hdl.handle.net/1911/78493
    Rights
    This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by the Association for Computing Machinery.
    Metadata
    Show full item record
    Collections
    • Computer Science Publications [134]
    • Faculty Publications [4990]

    Home | FAQ | Contact Us | Privacy Notice | Accessibility Statement
    Managed by the Digital Scholarship Services at Fondren Library, Rice University
    Physical Address: 6100 Main Street, Houston, Texas 77005
    Mailing Address: MS-44, P.O.BOX 1892, Houston, Texas 77251-1892
    Site Map

     

    Searching scope

    Browse

    Entire ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsType

    My Account

    Login

    Statistics

    View Usage Statistics

    Home | FAQ | Contact Us | Privacy Notice | Accessibility Statement
    Managed by the Digital Scholarship Services at Fondren Library, Rice University
    Physical Address: 6100 Main Street, Houston, Texas 77005
    Mailing Address: MS-44, P.O.BOX 1892, Houston, Texas 77251-1892
    Site Map