DAG Automata - Variants, Languages and Properties
We study final-state automata that work on directed acyclic graphs (DAGs). We consider ordered and unordered DAGs and show that they can be simulated by each other. Then we show that deterministic DAG automata are weaker then nondeterministic automata. Some properties of recognizable DAG languages a...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Umeå universitet, Institutionen för datavetenskap
2015
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-105612 |