Content deleted Content added
AchedDamiman (talk | contribs) ←Created page with 'In computer science, one Counter automaton is a Pushdown automaton with only two symbols in <math>\Gamma\,</math> (A and the initial symbol) (the finite set...' |
AchedDamiman (talk | contribs) No edit summary |
||
Line 1: | Line 1: | ||
In [[computer science]], one Counter automaton is a [[Pushdown automaton]] with only two symbols in <math>\Gamma\,</math> (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: |
In [[computer science]], one Counter automaton is a [[Pushdown automaton]] with only two symbols in <math>\Gamma\,</math> (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: |
||
<math> |
<math> { xy\in\{a, b}{*} : number_of_a(x) = number_of_b(y)} w\} </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 20:15, 11 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:
Failed to parse (syntax error): {\displaystyle { xy\in\{a, b}{*} : number_of_a(x) = number_of_b(y)} w\} }
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:Computer science]