Marking shortest paths on pushdown graphs does not preserve MSO decidability (Q2629775): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1510.04000 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4714446 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pushdown processes: Games and model-checking / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank | |||
Normal rank | |||
Latest revision as of 06:24, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Marking shortest paths on pushdown graphs does not preserve MSO decidability |
scientific article |
Statements
Marking shortest paths on pushdown graphs does not preserve MSO decidability (English)
0 references
7 July 2016
0 references
formal methods
0 references
MSO logic
0 references
pushdown graphs
0 references
