Recognizability equals definability for partial k-paths (Q4572008)

scientific article; zbMATH DE number 6898431

Language	Label	Description	Also known as
English	Recognizability equals definability for partial k-paths	scientific article; zbMATH DE number 6898431

Statements

instance of

scholarly article

0 references

title

Recognizability equals definability for partial k-paths (English)

0 references

author

Valentine Kabanets

0 references

published in

Automata, Languages and Programming

0 references

publication date

4 July 2018

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

cites work

Weak Second‐Order Arithmetic and Finite Automata

0 references

The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

0 references

The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability

0 references

The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

0 references

The monadic second order logic of graphs. VI: On several representations of graphs by relational structures

0 references

The monadic second-order logic of graphs. VIII: Orientations

0 references

Tree acceptors and some of their applications

0 references

Recognizability equals definability for partial k-paths

0 references

Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees

0 references

Graph minors. II. Algorithmic aspects of tree-width

0 references

The structure of the models of decidable monadic theories of graphs

0 references

Identifiers

zbMATH Open document ID

1401.03066

0 references

DOI

10.1007/3-540-63165-8_233

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4572008