Rewriting Cyclic Normal Automata and Their Applications.
| Autor: | Dimlo, U.M. Fernandes, Vemuganti, Yashaswi, Rajan, E.G. |
|---|---|
| Zdroj: | 2012 International Conference on Computing Sciences; 1/ 1/2012, p47-51, 5p |
| Abstrakt: | This paper introduces novel concepts like rewriting cyclic normal automata and flower automata. The principle of normalization of automata states that for any given automaton belonging to a family of automata one can construct a equivalent rewriting cyclic normal automaton. [ABSTRACT FROM PUBLISHER] |
| Databáze: | Complementary Index |
| Externí odkaz: |
|