85,830 research outputs found

    The IO- and OI-hierarchies

    Get PDF
    AbstractAn analysis of recursive procedures in ALGOL 68 with finite modes shows, that a denotational semantics of this language can be described on the level of program schemes using a typed λ-calculus with fixed-point operators. In the first part of this paper, we derive classical schematological theorems for the resulting class of level-n schemes. In part two, we investigate the language families obtained by call-by-value and call-by-name interpretation of level-n schemes over the algebra of formal languages. It is proved, that differentiating according to the functional level of recursion leads to two infinite hierarchies of recursive languages, the IO- and OI-hierarchies, which can be characterized as canonical extensions of the regular, context-free, and IO- and OI-macro languages, respectively. Sufficient conditions are derived to establish strictness of IO-like hierarchies. Finally we derive, that recursion on higher types induces an infinite hierarchy of control structures by proving that level-n schemes are strictly less powerful than level-n+1 schemes

    Hierarchies of hyper-AFLs

    Get PDF
    For a full semi-AFL K, B(K) is defined as the family of languages generated by all K-extended basic macro grammars, while H(K) B(K) is the smallest full hyper-AFL containing K; a full basic-AFL is a full AFL K such that B(K) = K (hence every full basic-AFL is a full hyper-AFL). For any full semi-AFL K, K is a full basic-AFL if and only if B(K) is substitution closed if and only if H(K) is a full basic-AFL. If K is not a full basic-AFL, then the smallest full basic-AFL containing K is the union of an infinite hierarchy of full hyper-AFLs. If K is a full principal basic-AFL (such as INDEX, the family of indexed languages), then the largest full AFL properly contained in K is a full basic-AFL. There is a full basic-AFL lying properly in between the smallest full basic-AFL and the largest full basic-AFL in INDEX

    Three hierarchies of transducers

    Get PDF
    Composition of top-down tree transducers yields a proper hierarchy of transductions and of output languages. The same is true for ETOL systems (viewed as transducers) and for two-way generalized sequential machines

    Wadge Degrees of ω\omega-Languages of Petri Nets

    Full text link
    We prove that ω\omega-languages of (non-deterministic) Petri nets and ω\omega-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω\omega-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω\omega-languages of (non-deterministic) Turing machines which also form the class of effective analytic sets. In particular, for each non-null recursive ordinal α<ω_1CK\alpha < \omega\_1^{{\rm CK}} there exist some Σ0_α{\bf \Sigma}^0\_\alpha-complete and some Π0_α{\bf \Pi}^0\_\alpha-complete ω\omega-languages of Petri nets, and the supremum of the set of Borel ranks of ω\omega-languages of Petri nets is the ordinal γ_21\gamma\_2^1, which is strictly greater than the first non-recursive ordinal ω_1CK\omega\_1^{{\rm CK}}. We also prove that there are some Σ_11{\bf \Sigma}\_1^1-complete, hence non-Borel, ω\omega-languages of Petri nets, and that it is consistent with ZFC that there exist some ω\omega-languages of Petri nets which are neither Borel nor Σ_11{\bf \Sigma}\_1^1-complete. This answers the question of the topological complexity of ω\omega-languages of (non-deterministic) Petri nets which was left open in [DFR14,FS14].Comment: arXiv admin note: text overlap with arXiv:0712.1359, arXiv:0804.326

    A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata

    Full text link
    Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an input alphabet with 2(n-1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a consequence of our construction, we solve the open problem formulated by Meduna et al. Then we extend these results to m-state realtime deterministic pushdown automata, for all m at least 1. The existence of such a hierarchy for m-state deterministic pushdown automata is left open

    Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

    Get PDF
    The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the single levels of these hierarchies and obtain the following results: - The classes of the Boolean hierarchy over level Σ1\Sigma_1 of the dot-depth hierarchy are decidable in NLNL (previously only the decidability was known). The same remains true if predicates mod dd for fixed dd are allowed. - If modular predicates for arbitrary dd are allowed, then the classes of the Boolean hierarchy over level Σ1\Sigma_1 are decidable. - For the restricted case of a two-letter alphabet, the classes of the Boolean hierarchy over level Σ2\Sigma_2 of the Straubing-Th\'erien hierarchy are decidable in NLNL. This is the first decidability result for this hierarchy. - The membership problems for all mentioned Boolean-hierarchy classes are logspace many-one hard for NLNL. - The membership problems for quasi-aperiodic languages and for dd-quasi-aperiodic languages are logspace many-one complete for PSPACEPSPACE

    Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes

    Full text link
    We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which characterize programmed grammars with the finite index restriction; looking at the number of components of such systems, we obtain surprisingly rich lattice structures for the inclusion relations between the corresponding language families. Secondly, we impose the finite index restriction on cooperating distributed grammar systems working in hybrid modes themselves, which leads us to new characterizations of programmed grammars of finite index.Comment: In Proceedings AFL 2014, arXiv:1405.527

    Highly Undecidable Problems For Infinite Computations

    Get PDF
    We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are Π21\Pi_2^1-complete, hence located at the second level of the analytical hierarchy, and "highly undecidable". In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and the unambiguity problem are all Π21\Pi_2^1-complete for context-free omega-languages or for infinitary rational relations. Topological and arithmetical properties of 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are also highly undecidable. These very surprising results provide the first examples of highly undecidable problems about the behaviour of very simple finite machines like 1-counter automata or 2-tape automata.Comment: to appear in RAIRO-Theoretical Informatics and Application
    corecore