Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

WOLLIC
2010
Springer

favoriteEmaildiscussreport

248views Artificial Intelligence» more WOLLIC 2010»

Mechanisation of PDA and Grammar Equivalence for Context-Free Languages

13 years 9 months ago

Mechanisation of PDA and Grammar Equivalence for Context-Free Languages

Download nicta.com.au

We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated proofs, but also how intensive such a process can turn out to be. The proofs blow up in size in way difﬁcult to predict from examining original textbook presentations. Even a meticulous text proof has “intuitive” leaps that need to be identiﬁed and formalised.

Aditi Barthwal, Michael Norrish

Real-time Traffic

Artificial Intelligence | Meticulous Text Proof | Original Textbook Presentations | Provers | WOLLIC 2010 |

claim paper

Related Content

» Linear ContextFree Rewriting Systems and Deterministic TreeWalking Transducers

» A Polynomial Time Extension of Parallel Multiple ContextFree Grammar

» Distributional Learning of Some ContextFree Languages with a Minimally Adequate Teacher

» The Polytope of ContextFree Grammar Constraints

» Associative definition of programming languages

» Tile Rewriting Grammars

» Hierarchical Phrasebased Translation Representations

» Better Synchronous Binarization for Machine Translation

Post Info
More Details (n/a)

Added	31 Jan 2011
Updated	31 Jan 2011
Type	Journal
Year	2010
Where	WOLLIC
Authors	Aditi Barthwal, Michael Norrish

Comments (0)