Recursive transition network

File:Fancy noun recursive transition network.svg

A recursive transition network ("RTN") is a graph theoretical schematic used to represent the rules of a context-free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed according to the rules of an RTNA sentence is generated by a RTN by applying the generative rules specified in the RTN itself. These represent any set of rules or a function consisting of a finite number of steps. is said to be "well-formed". The structural elements of a well-formed sentence may also be well-formed sentences by themselves, or they may be simpler structures. This is why RTNs are described as recursive.{{cite book|author=Ela Kumar|title=Artificial Intelligence|url=https://books.google.com/books?id=rNmAY-RcGKYC&pg=PA324|date=20 September 2008|publisher=I. K. International Pvt Ltd|isbn=978-81-906566-6-5|pages=324–}}