Skip to main content
SpringerLink
Log in

Recognizability equals definability for partial k-paths

  • Session 20: Semantics II and Automata
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1256))

Included in the following conference series:

Abstract

We prove that every recognizable family of partial k-paths is definable in a counting monadic second-order logic. We also show the obstruction set of the class of partial k-paths computable for every k.

This research was done while the author was at Simon Fraser University [8].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Büchi. Weak second-order arithmetic and finite automata. Zeitschr. j. math. Logik und Grundlagen d. Math., 6:66–92, 1960.

    Google Scholar 

  2. B. Courcelle. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, 85:12–75, 1990.

    Article  Google Scholar 

  3. B. Courcelle. The monadic second-order logic of graphs. V. On closing the gap between definability and recognizability. Theoret. Comput. Sci., 80:153–202, 1991.

    Article  Google Scholar 

  4. B. Courcelle. The monadic second-order logic of graphs. III. Tree-decompositions, minors and complexity issues. Informatique théorique et Appl., 26:257–286, 1992.

    Google Scholar 

  5. B. Courcelle. The monadic second-order logic of graphs. VI. On several representations of graphs by relational structures. Discr. Appl. Math., 54:117–149, 1994.

    Article  Google Scholar 

  6. B. Courcelle. The monadic second-order logic of graphs. VIII. Orientations. Ann. Pure Appl. Logic, 72:103–143, 1995.

    Article  Google Scholar 

  7. J. Doner. Tree acceptors and some of their applications. J. Computer and System Sciences, 4:406–451, 1970.

    Google Scholar 

  8. V. Kabanets. Recognizability equals definability for partial k-paths. Master's thesis, Simon Fraser University, June 1996.

    Google Scholar 

  9. D. Kaller. Definability equals recognizability of partial 3-trees, 1996. Workshop on Graph-Theoretic Concepts in Computer Science (WG '96).

    Google Scholar 

  10. N. Robertson and P. Seymour. Graph minors. II. Algorithmic aspects of treewidth. J. Algorithms, 7:309–322, 1986.

    Article  Google Scholar 

  11. D. Seese. The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic, 53:169–195, 1991.

    Article  Google Scholar 

Download references

Author information

Author notes

  1. Valentine Kabanets

    Present address: Department of Computer Science, University of Toronto, M5S 3G4, Toronto, ON, Canada

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, Vancouver, Canada

    Valentine Kabanets

Authors
  1. Valentine Kabanets
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Valentine Kabanets .

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kabanets, V. (1997). Recognizability equals definability for partial k-paths. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_233

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_233

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation