"Finite automata, bounded treewidth, and well-quasiordering."

Karl R. Abrahamson, Michael R. Fellows (1991)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2014-09-17

- no documents available
- export record
  dblp key:
  - conf/gst/AbrahamsonF91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gst/AbrahamsonF91
Karl R. Abrahamson, Michael R. Fellows:
Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory 1991: 539-563

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.