Counter automaton
In computer science, a counter automaton is a pushdown automaton with only two symbols, and the initial symbol in , the finite set of stack symbols. This class of automata can recognize a subset of context-free languages, for instance the language To accept the above language, let be a word of the form above. The automaton can use the symbol to count the number of s in (writing an for each in ) and deleting an for each in .
primaryTopic
Counter automaton
In computer science, a counter automaton is a pushdown automaton with only two symbols, and the initial symbol in , the finite set of stack symbols. This class of automata can recognize a subset of context-free languages, for instance the language To accept the above language, let be a word of the form above. The automaton can use the symbol to count the number of s in (writing an for each in ) and deleting an for each in .
has abstract
In computer science, a counter ...... and deleting an for each in .
@en
Wikipage page ID
20,169,659
Wikipage revision ID
705,188,026
comment
In computer science, a counter ...... and deleting an for each in .
@en
label
Counter automaton
@en