Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Downey, R.G., Fellows, M.R. (1999). Methods via Automata and Bounded Treewidth. In: Parameterized Complexity. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0515-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0515-9_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6798-0
Online ISBN: 978-1-4612-0515-9
eBook Packages: Springer Book Archive