linkedin facebook twitter rss

29 Feb ATN

An Automated Transition Network uses a grammar to parse input. It consists of a state machine that transitions from state to state based on the predictable succession of tokens in a stream of tokens that abide by strict grammar rules.
Keywords: state space
algorithm
design
grammar
parsing
rule
References: AI programming
algorithms
automata
computing
formalisms
logic
rules

Leave a Reply

Your email address will not be published. Required fields are marked *