Real-Time Strict Deterministic Languages
From MaRDI portal
Publication:5684249
DOI10.1137/0201024zbMath0267.68034OpenAlexW2070015363MaRDI QIDQ5684249
Michael A. Harrison, Ivan M. Havel
Publication date: 1972
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0201024
Related Items (22)
A pumping lemma for real-time deterministic context-free languages ⋮ Iteration theorems for families of strict deterministic languages ⋮ Decidable subcases of the equivalence problem for recursive program schemes ⋮ The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine ⋮ The equivalence problem for LL- and LR-regular grammars ⋮ A hierarchy of real-time deterministic languages and their equivalence ⋮ Unnamed Item ⋮ On jump-deterministic pushdown automata ⋮ The inclusion problem for simple languages ⋮ Normal forms of deterministic grammars ⋮ On LR(k) grammars and languages ⋮ A left part theorem for grammatical trees ⋮ On equivalence of grammars through transformation trees ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras ⋮ Synchronizable deterministic pushdown automata and the decidability of their equivalence ⋮ Strict deterministic grammars ⋮ A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars ⋮ Constructing a realtime deterministic pushdown automaton from a grammar ⋮ 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: Real-Time Strict Deterministic Languages
