Climbing up the elementary complexity classes with theories of automatic 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:Computer Science Logic 2018, (2018), Seite 3:1-3:16
Main Author: Abu Zaid, Faried (Author)
Other Involved Persons: Kuske, Dietrich ; Lindner, Peter
Format: electronic Article
Language:English
Published: 2018
Physical Description:16
DOI:10.4230/LIPIcs.CSL.2018.3
Local Subject Headings:
Further Information:http://dx.doi.org/10.4230/LIPIcs.CSL.2018.3
http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:0030-drops-96701
urn:nbn:de:0030-drops-96701
QR Code: Show QR Code

Ilmenau University Library, Online

Holdings details from Universit├Ątsbibliothek Ilmenau, Online
Shelf Mark: -
Online Access: http://dx.doi.org/10.4230/LIPIcs.CSL.2018.3
Online Access: http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:0030-drops-96701
Availability: Available - Online.

Published in: Computer Science Logic 2018, (2018), Seite 3:1-3:16

Feedback Delivery Service