default search action
"Finite automata, bounded treewidth, and well-quasiordering."
Karl R. Abrahamson, Michael R. Fellows (1991)
- Karl R. Abrahamson, Michael R. Fellows:
Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory 1991: 539-563
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.