• Deutsch
Login

OPUS

  • Home
  • Search
  • Browse
  • Publish
  • FAQ

Refine

Document Type

  • Part of Periodical (1) (remove)

Language

  • English (1) (remove)

Keywords

  • directed acyclic graphs (1) (remove)

Institute

  • Fachbereich 4 (1) (remove)

1 search hit

  • 1 to 1
  • 10
  • 20
  • 50
  • 100
Finite automata on unranked and unordered DAGs (2007)
Priese, Lutz
We introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and nondeterministic automata operating on them. Those dag automata are a conservative extension of the Tu,u-automata of Courcelle on unranked, unordered trees and forests. Several examples of dag languages acceptable and not acceptable by dag automata and some closure properties are given.
  • 1 to 1

OPUS4 Logo

  • Contact
  • Imprint
  • Sitelinks