Highlights 2021
Regular expressions for languages of tree-width 2 graphs
Abstract
We propose a formalism of regular expressions for languages of tree-width 2 graphs, equivalent to counting MSO.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- Highlights of Logic, Games and Automata
- Archive span
- 2013-2025
- Indexed papers
- 1236
- Paper id
- 34976639481201251