Searching for "Strict Deterministic Grammars." – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
Decidability of DPDA equivalence
- …]. From language theory we utilise strict deterministic grammars, which were introduced by Harrison…
- Cited by 20 (2 self) – Add To MetaCart
-
Deterministic Cooperating Distributed Grammar Systems
- … syntactical conditions considered for strict deterministic grammars are extended to cooperating distributed…
- Cited by 3 (0 self) – Add To MetaCart
-
The equivalence problem for t-turn DPDA is co-NP.
- … the notion of strict-deterministic grammar G = >, as a right-action of X over a subset of matrices…
- Add To MetaCart
-
L(A)=L(B)? yet another decidability proof.
- … restrict the proof to the case of a proper, reduced strict-deterministic grammar; - some \second level…
- Add To MetaCart
-
Deciding DPDA Equivalence is Primitive Recursive
- … and without #-transitions. 3 Strict deterministic grammars Strict deterministic grammars were introduced…
- Cited by 7 (0 self) – Add To MetaCart
-
Deterministic Finite Automata with Recursive Calls and DPDA's
- … such as C. Our model is also related to the strict deterministic grammars of Harrison and Havel [HH73…
- Add To MetaCart
-
Deciding Bisimilarity between BPA and BPP Processes
- … deterministic grammars (a particular formulation of deterministic pushdown automata) [23]. This final result…
- Cited by 1 (1 self) – Add To MetaCart
-
D.2.4 [Software/Program Verification]: Formal methods General Terms Theory, Verification
- …] is that bisimilarity is decidable over strict deterministic grammars. This result reinforces (and gives a shorter proof…
- Add To MetaCart
-
Gamma(A) \equiv Gamma(B)?
- …]; a) (13) where p; q; 2 Q; a 2 X [ ffflg; q 2 ffi (pz; a). GM is a strict-deterministic grammar. (A…
- Add To MetaCart
-
L(a) = L(b)?
- … is a strict-deterministic grammar. (A general theory of this class of grammars is exposed in [Har78…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
