scientific article
From MaRDI portal
Publication:4072875
zbMath0313.68061MaRDI QIDQ4072875
A. J. Korenjak, John E. Hopcrofts
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (55)
Polynomial-time identification of very simple grammars from positive data. ⋮ A pumping lemma for real-time deterministic context-free languages ⋮ An axiomatic approach to the Korenjak-Hopcroft algorithms ⋮ The extended equivalence problem for a class of non-real-time deterministic pushdown automata ⋮ Some observations concerning alternating Turing machines using small space ⋮ A polynomial algorithm for deciding bisimilarity of normed context-free processes ⋮ A note on top-down deterministic languages ⋮ Prime normal form and equivalence of simple grammars ⋮ A formal specification of document processing ⋮ The equivalence problem for real-time strict deterministic pushdown automata ⋮ Hierarchies and Characterizations of Stateless Multicounter Machines ⋮ Superdeterministic DPDAs: The method of accepting does affect decision problems ⋮ A representation of trees by languages. II ⋮ Iteration theorems for families of strict deterministic languages ⋮ Unnamed Item ⋮ Context-free like restrictions on selective rewriting ⋮ Some remarks on the KH algorithm fors-grammars ⋮ The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine ⋮ New techniques for proving the decidability of equivalence problem ⋮ The equivalence problem for LL- and LR-regular grammars ⋮ A hierarchy of real-time deterministic languages and their equivalence ⋮ Unnamed Item ⋮ Valuations of languages, with applications to fractal geometry ⋮ On Stateless Multicounter Machines ⋮ Pushdown tree automata ⋮ On the computational complexity of bisimulation, redux ⋮ Conjunctive grammars with restricted disjunction ⋮ Polynomial time learning of simple deterministic languages via queries and a representative sample ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ On jump-deterministic pushdown automata ⋮ On decision problems for parameterized machines ⋮ On the equivalence, containment, and covering problems for the regular and context-free languages ⋮ Completeness results for the equivalence of recursive schemas ⋮ The covering problem for linear context-free grammars ⋮ The inclusion problem for simple languages ⋮ Equivalence problems for deterministic context-free languages and monadic recursion schemes ⋮ A direct algorithm for checking equivalence of LL(k) grammars ⋮ Complexity metatheorems for context-free grammar problems ⋮ A representation of trees by languages. I ⋮ On equivalence and subclass containment problems for deterministic context-free languages ⋮ Two decidability results for deterministic pushdown automata ⋮ Multilayer syntactic analysis of parallel programming systems ⋮ On equivalence of grammars through transformation trees ⋮ Simple chain grammars and languages ⋮ Structural equivalence of context-free grammars ⋮ A characterization of s-languages ⋮ Synchronizable deterministic pushdown automata and the decidability of their equivalence ⋮ Top-down syntax nalysis ⋮ Generation, recognition and parsing of context-free languages by means of recursive graphs ⋮ A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars ⋮ An algebraic characterization of some principal regulated rational cones ⋮ Derivation languages of grammar forms† ⋮ New families of non real time dpda's and their decidability results ⋮ Some results on subclass containment problems for special classes of dpda's related to nonsingular machines ⋮ An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
This page was built for publication:
