Content deleted Content added
Shadowjams (talk | contribs) |
Ashutosh y0078 (talk | contribs) No edit summary |
||
Line 7: | Line 7: | ||
For accept the previous language, the automaton can use the symbol A for count the number of a in x (writing A per each A in x) and deleting one A per each b in y. |
For accept the previous language, the automaton can use the symbol A for count the number of a in x (writing A per each A in x) and deleting one A per each b in y. |
||
[[Category:Automata]] |
[[Category:Automata theory]] |
||
[[Category:Computational models]] |
[[Category:Computational models]] |
Revision as of 17:42, 11 February 2010
In computer science, one counter automaton is a Pushdown automaton with only two symbols in (A and the initial symbol) (the finite set of stack symbols), this automaton can be used for accept one subset of Context free languages, example the language:
For accept the previous language, the automaton can use the symbol A for count the number of a in x (writing A per each A in x) and deleting one A per each b in y.