MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Decidability of DPDA equivalence." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

Decidability of DPDA equivalence
by Colin Stirling — 1999
…Decidability of DPDA equivalence Colin Stirling Division of Informatics University of Edinburgh…
Cited by 20 (2 self) – Add To MetaCart

Deciding DPDA Equivalence is Primitive Recursive
by Colin Stirling — 2002 — In Proceedings 29th Colloqium on Automata, Languages and Programming, number 2380 in Lecture Notes in Computer Science
…Deciding DPDA Equivalence is Primitive Recursive Colin Stirling Division of Informatics University…
Cited by 7 (0 self) – Add To MetaCart

An approach to deciding observational equivalence of Algol-like languages
by C. -h. L. Ong — Annals of Pure and Applied Logic
… recognize the same language, M N is decidable. The DPDA Equivalence Problem \Is there an eective…
Cited by 1 (0 self) – Add To MetaCart

Deterministic Finite Automata with Recursive Calls and DPDA's
by Jean H. Gallier, Salvatore La Torre, Supratik Mukhopadhyay — 2003
… the decidability of the DPDA equivalence problem also the decidability of the equivalence problem for DFA…
Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB