Content deleted Content added
159.226.43.43 (talk) No edit summary |
134.82.133.52 (talk) No edit summary |
||
Line 3: | Line 3: | ||
In [[computer science]], one '''counter automaton''' is a [[Pushdown automaton]] with only two symbols A and the initial symbol in <math>\Gamma\,</math> (the finite set of stack symbols), this automaton can be used for accept one subset of Context free languages, example the language: |
In [[computer science]], one '''counter automaton''' is a [[Pushdown automaton]] with only two symbols A and the initial symbol in <math>\Gamma\,</math> (the finite set of stack symbols), this automaton can be used for accept one subset of Context free languages, example the language: |
||
<math> \{\ |
<math> \{\ a^nb^n : n \in \mathbb{N} \} </math> |
||
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. |
Revision as of 00:13, 15 December 2010
In computer science, one counter automaton is a Pushdown automaton with only two symbols A and the initial symbol in (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.