Uniformly automatic classes of finite structures

We investigate the recently introduced concept of uniformly tree-automatic classes in the realm of parameterized complexity theory. Roughly speaking, a class of finite structures is uniformly tree-automatic if it can be presented by a set of finite trees and a tuple of automata. A tree t encodes a s...

Full description

Bibliographic Details
Published in:38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (2018), Seite 10:1-10:21
Main Author: Abu Zaid, Faried (Author)
Format: electronic Article
Language:English
Published: 2018
Physical Description:21
DOI:10.4230/LIPIcs.FSTTCS.2018.10
Local Subject Headings:
Further Information:http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2018.10
http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:0030-drops-99095
urn:nbn:de:0030-drops-99095
QR Code: Show QR Code