Tree Automata, (Dis-)Equality Constraints and Term Rewriting
| Autor: | Sophie Tison |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES
Theoretical computer science Computer science Term (logic) ω-automaton Nonlinear Sciences::Cellular Automata and Lattice Gases Automaton Tree (data structure) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Confluence Computer Science::Programming Languages Automata theory Quantum finite automata Rewriting Algorithm Computer Science::Formal Languages and Automata Theory |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783642216909 TLCA |
| DOI: | 10.1007/978-3-642-21691-6_2 |
| Popis: | Connections between Tree Automata and Term Rewriting are now well known. Whereas tree automata can be viewed as a subclass of ground rewrite systems, tree automata are successfully used as decision tools in rewriting theory. Furthermore, applications, including rewriting theory, have influenced the definition of new classes of tree automata. In this talk, we will first present a short and not exhaustive reminder of some fruitful applications of tree automata in rewriting theory. Then, we will focus on extensions of tree automata, specially tree automata with local or/and global (dis-)equality constraints: we will emphasize new results, compare different extensions, and sketch some applications. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|