60 research outputs found

    Monoid automata for displacement context-free languages

    Full text link
    In 2007 Kambites presented an algebraic interpretation of Chomsky-Schutzenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the class of displacement context-free languages which are equivalent to well-nested multiple context-free languages. We also obtain a characterization of k-displacement context-free languages in terms of monoid automata and show how such automata can be simulated on two stacks. We introduce the simultaneous two-stack automata and compare different variants of its definition. All the definitions considered are shown to be equivalent basing on the geometric interpretation of memory operations of these automata.Comment: Revised version for ESSLLI Student Session 2013 selected paper

    Algebraic Methodology and Software Technology (AMAST'93): Proceedings of the Third International Conference, University of Twente, Enschede, The Netherlands 21–25 June 1993

    No full text
    The goal of the AMAST conferences is to foster algebraic methodology as a foundation for software technology, and to show that this can lead to practical mathematical alternatives to the ad-hoc approaches commonly used in software engineering and development. The first two AMAST conferences, held in May 1989 and May 1991 at the University of Iowa, were well received and encouraged the regular organization of further AMAST conferences on a biennial schedule. The third Conference on Algebraic Methodology and Software Technology was held in the campus of the University of Twente, The Netherlands, during the first week of Summer 1993. Nearly a hundred people from all continents attended the conference. The largest interest received by the AMAST conference among the professionals extended to include the administration organizations as well. AMAST'93 was opened by the Rector of the University of Twente, followed by the Local Chairman. Their opening addresses open this proceedings, too. The proceedings contains 8 invited papers and 32 selected communica­ tions. The selection was very strict, for 121 submissions were received

    Congruence-free inverse semigroups with zero

    No full text

    On the coverage of partial validations

    No full text

    Multi-tape automata for speech and language systems: A prolog implementation

    No full text
    corecore