Weak MSO+U with Path Quantifiers over Infinite Trees release_fg7cwa6t2vgttdan4wtvs4wvs4

by Mikołaj Bojańczyk

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2014   p38-49

Archived Files and Locations

application/pdf  2.0 MB
file_xbq5owrjczh7tiq4kmcq4nshmm
arxiv.org (repository)
www.mimuw.edu.pl (web)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  chapter
Stage   published
Year   2014
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3f0d2b18-6745-4dcf-8358-7f874a95a299
API URL: JSON