Content deleted Content added
AchedDamiman (talk | contribs) No edit summary |
Fabrictramp (talk | contribs) New page patrol; You can help! using AWB |
||
Line 1: | Line 1: | ||
{{orphan|date=November 2008}} |
|||
⚫ | |||
{{unreferenced|date=November 2008}} |
|||
⚫ | |||
<math> {\ xy \in\ {a, b}{*} : numberofa(x) = numberofb(y)} \} </math> |
<math> {\ xy \in\ {a, b}{*} : numberofa(x) = numberofb(y)} \} </math> |
Revision as of 17:53, 22 November 2008
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.