Cart (Loading....) | Create Account
Close category search window
 

Decidability of DPDA Language Equivalence via First-Order Grammars

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jancar, P. ; Tech. Univ. of Ostrava, Ostrava, Czech Republic

Decidability of language equivalence of deterministic pushdown automata (DPDA) was established by G. Senizergues (1997), who thus solved a famous long-standing open problem. A simplified proof, also providing a primitive recursive complexity upper bound, was given by C. Stirling (2002). In this paper, the decidability is re-proved in the framework of first-order terms and grammars (given by finite sets of root-rewriting rules). The proof is based on the abstract ideas used in the previous proofs, but the chosen framework seems to be more natural for the problem and allows a short presentation which should be transparent for a general computer science audience.

Published in:

Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on

Date of Conference:

25-28 June 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.