Comments on Complete Sets of Tree Automata
| Autor: | Ferenc Gécseg |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
Discrete mathematics
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Nested word ω-automaton Nonlinear Sciences::Cellular Automata and Lattice Gases TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Tree structure Continuous spatial automaton Quantum finite automata Automata theory Tree automaton Tree (set theory) Computer Science::Formal Languages and Automata Theory Mathematics |
| Zdroj: | Developments in Language Theory ISBN: 9783540404347 Developments in Language Theory |
| DOI: | 10.1007/3-540-45007-6_3 |
| Popis: | Products of tree automata do not preserve the basic properties of homomorphically and metrically complete systems of finite state automata. To remedy it, we have introduced the concept of the quasi-product of tree automata which is only a slightly more general than the product. In this paper we present the main properties of the quasi-product concerning homomorphic and metric representation of tree automata, and compare the representing powers of special quasi-products. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|