External Links

    Journal: Fundamenta Informaticae

    Volume 81, Issue 4

    367 -- 377Benjamín René Callejas Bedregal. Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages
    379 -- 408Denisa Diaconescu, George Georgescu. Tense Operators on MV-Algebras and Lukasiewicz-Moisil Algebras
    409 -- 439María-Inés Fernández-Camacho, José-Ramón Sánchez-Couso. Binary Search Trees, Recurrent Properties andWave Equations
    441 -- 457Yo-Sub Han, Derick Wood. Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
    459 -- 471Florin Manea, Calina Ploscaru. A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem
    473 -- 484Jacek Marciniec. From Unification Compactness to Learnability
    485 -- 490René Schott, Jean-Claude Spehner. Erratum for Shuffle of Words and Araucaria Trees
    runs on