A Formalisation of the Normal Forms of Context-Free Grammars in HOL4-Reference-Cited by-同舟云学术

A Formalisation of the Normal Forms of Context-Free Grammars in HOL4

Published:2010 Issue: Volume: Page:95-109
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Barthwal Aditi,Norrish Michael

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15205-4_11.pdf

Reference6 articles.

1. Lecture Notes in Computer Science;A. Barthwal,2009

2. Barthwal, A., Norrish, M.: Mechanisation of pda and grammar equivalence for context-free languages. To appear in Proceedings of WoLLIC. Springer, Heidelberg (2010)

3. Chomsky, N.: On certain formal properties of grammars. Information and Control 2(2), 137–167 (1959)

4. Greibach, S.A.: A new normal-form theorem for context-free phrase structure grammars. J. ACM 12(1), 42–52 (1965)

5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bar-Hillel Theorem Mechanization in Coq;Logic, Language, Information, and Computation;2019

2. A Formalization of the ABNF Notation and a Verified Parser of ABNF Grammars;Lecture Notes in Computer Science;2018

3. On the Formalization of Some Results of Context-Free Language Theory;Logic, Language, Information, and Computation;2016

4. Certified Normalization of Context-Free Grammars;Proceedings of the 2015 Conference on Certified Programs and Proofs;2015-01-13

5. A mechanisation of some context-free language theory in HOL4;Journal of Computer and System Sciences;2014-03