B B.1 NOTES ON LANGUAGES AND ALGORITHMS

First Page		Document Content
Date: 2009-11-06 17:25:19 Logic Formal grammar Terminal and nonterminal symbols Context-free grammar Backus–Naur Form Pattern matching Function Assignment Well-formed formula Formal languages Software engineering Mathematics		B B.1 NOTES ON LANGUAGES AND ALGORITHMS Add to Reading List Source URL: aima.cs.berkeley.edu Download Document from Source Website File Size: 43,02 KB Share Document on Facebook

	Some Notes on Proofs with Alpha Graphs Frithjof Dau Technische Universit¨ at Dresden, Dresden, Germany DocID: 1r1sv - View Document
	A BDD Representation for Positive Equational Formulas Wenxin Song, Eugene W. Stark? Department of Computer Science State University of New York at Stony Brook DocID: 1qPwp - View Document
	Expressive Logical Combinators for Free Pierre Genevès (CNRS) Joint work with Alan Schmitt (Inria) IJCAI, July 30th 2015, Buenos Aires DocID: 1qN5j - View Document
	LBFO: toward an artificial language for ontology development Leonard F Jacuzzo National Center for Biomedical Ontology, Ontology Research Group, SUNY Center of Excellence in Bioinformatics Nature Precedings : doi:10.103 DocID: 1qM15 - View Document
	XQuery and Static Typing: Tackling the Problem of Backward Axes Pierre Genevès Nils Gesbert DocID: 1qIWp - View Document