5 research outputs found

    29th International Symposium on Algorithms and Computation: ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan

    Get PDF

    Descriptional Complexity of Formal Systems

    No full text
    The proceedings contain 24 papers. The special focus in this conference is on Descriptional Complexity of Formal Systems. The topics include: Sensing as a complexity measure; avoiding overlaps in pictures; on the degree of nondeterminism of tree adjoining languages and head grammar languages; on the average complexity of strong star normal form; most complex non-returning regular languages; uncountable realtime probabilistic classes; a parametrized analysis of algorithms on hierarchical graphs; graph-controlled insertion-deletion systems generating language classes beyond linearity; computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors; self-attraction removal from oritatami systems; one-time nondeterministic computations; branching measures and nearly acyclic NFAS; a pumping lemma for ordered restarting automata; concise representations of reversible automata; reset complexity of ideal languages over a binary alphabet; state complexity of suffix distance and the quotient operation on input driven pushdown automata
    corecore