Content deleted Content added
not an orphan anymore! |
m Robot - Moving category Automata theory to Category:Automata (computation) per CFD at Wikipedia:Categories for discussion/Log/2015 October 22. |
||
Line 10: | Line 10: | ||
{{DEFAULTSORT:Counter Automaton}} |
{{DEFAULTSORT:Counter Automaton}} |
||
[[Category:Automata |
[[Category:Automata (computation)]] |
||
[[Category:Models of computation]] |
[[Category:Models of computation]] |
||
Revision as of 03:28, 19 November 2015
In computer science, a counter automaton is a Pushdown automaton with only two symbols, A 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 x be a word on the form above. The automaton can use the symbol A to count the number of a's in x (writing an A for each a in x) and deleting an A for each b in x.