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