Advertisement
Published in:
1999 | OriginalPaper | Chapter
Methods via Automata and Bounded Treewidth
Authors : R. G. Downey, M. R. Fellows
Published in: Parameterized Complexity
Publisher: Springer New York
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Many of the methods we use on graphs are analogs of methods used for languages accepted by finite automata. Because of this, in the next few sections we will give a self-contained account of the aspects of classical formal language theory which we need. We begin with finite automata.