scientific article
From MaRDI portal
Publication:3292904
zbMath0106.34501MaRDI QIDQ3292904
No author found.
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (89)
The theory of languages ⋮ Some formal results about stratificational grammars and their relevance to linguistics ⋮ Bounded languages described by GF(2)-grammars ⋮ A helpful result for proving inherent ambiguity ⋮ Boolean grammars ⋮ A two-dimensional hierarchy for attributed tree transducers ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ The theory of languages ⋮ The interchange or pump (di)lemmas for context-free languages ⋮ A quasi-polynomial-time algorithm for sampling words from a context-free language ⋮ Rational index of languages with bounded dimension of parse trees ⋮ Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Comparisons of Parikh's condition to other conditions for context-free languages ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Unnamed Item ⋮ Beyond operator-precedence grammars and languages ⋮ One-way weak-stack-counter automata ⋮ Infinite results ⋮ A Note on Pushdown Store Automata and Regular Systems ⋮ On the complexity of automatic complexity ⋮ The different shades of infinite session types ⋮ Effective categoricity of automatic equivalence and nested equivalence structures ⋮ Two iteration theorems for the LL(k) languages ⋮ A pumping lemma for flip-pushdown languages ⋮ An infinite hierarchy of intersections of context-free languages ⋮ New techniques for proving the decidability of equivalence problem ⋮ Monadic Thue systems ⋮ A note on the sufficiency of Sokolowski's criterion for context-free languages ⋮ A new algorithm for regularizing one-letter context-free grammars. ⋮ Immunity and pseudorandomness of context-free languages ⋮ Unnamed Item ⋮ Grammar semantics, analysis and parsing by abstract interpretation ⋮ Unnamed Item ⋮ The range of non-linear natural polynomials cannot be context-free ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ The inclusion problem for some subclasses of context-free languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A class of infinite dimensional linear systems ⋮ On the computational complexity of bisimulation, redux ⋮ Structure des grammaires d'ambiguite bornee ⋮ The unsolvability of the equality problem for sentential forms of context-free grammars ⋮ Decidability of operation problems for T0L languages and subclasses ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ The Turing degree of the inherent ambiguity problem for context-free languages ⋮ Pushdown automata and constant height: decidability and bounds ⋮ On derivation trees of indexed grammars - an extension of the uvwxy- theorem ⋮ Membership for growing context-sensitive grammars is polynomial ⋮ Intercalation lemmas for tree transducer languages ⋮ On LR(k) grammars and languages ⋮ Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet ⋮ Ogden's lemma, multiple context-free grammars, and the control language hierarchy ⋮ A simplified proof of Parikh's theorem ⋮ Basic process algebra with deadlocking states ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity ⋮ \(\omega\)-computations on deterministic pushdown machines ⋮ Pumping lemmas for term languages ⋮ Undecidability of Operation Problems for T0L Languages and Subclasses ⋮ How does adiabatic quantum computation fit into quantum automata theory? ⋮ On equivalence of grammars through transformation trees ⋮ Bracketed context-free languages ⋮ Reduktionssätze über eine Klasse formaler Sprachen mit endlich vielen Zuständen ⋮ Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen ⋮ A Perfect Class of Context-Sensitive Timed Languages ⋮ Derivation-bounded languages ⋮ Generalized sequential machine maps ⋮ Syntactic operators on full semiAFLs ⋮ Probabilistic tree automata and context free languages ⋮ Substitution in families of languages ⋮ A hierarchy between context-free and context-sensitive languages ⋮ PANON-1B: A programming language for symbol manipulation ⋮ Unilateral context sensitive grammars and left-to-right parsing ⋮ Comparisons between some pumping conditions for context-free languages ⋮ Multitape finite automata with rewind instructions ⋮ Frontier between decidability and undecidability: A survey ⋮ Ambiguity and decision problems for local adjunct languages ⋮ Some applications of the formalization of the pumping lemma for context-free languages ⋮ Propositional dynamic logic of nonregular programs ⋮ The dual of concatenation ⋮ Decidability of Right One-Way Jumping Finite Automata ⋮ A note on undecidable properties of formal languages ⋮ Control sets on grammars ⋮ A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions ⋮ Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes ⋮ A pumping lemma for output languages of macro tree transducers
This page was built for publication:
