Record link: 
http://hdl.handle.net/20.500.12708/147485
-
Title: 
Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
-
Citation: 
Eberhard, S., Ebner, G., & Hetzl, S. (2017). Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars. ACM Transactions on Computational Logic, 18(4), 1–20. https://doi.org/10.1145/3127401
-
Publisher DOI: 
10.1145/3127401
-
Publication Type: 
Article - Original Research Article
en
Language: 
English
-
Authors: 
Eberhard, Sebastian 
Ebner, Gabriel 
Hetzl, Stefan 
-
Organisational Unit: 
E104-02 - Forschungsbereich Computational Logic 
-
Journal: 
ACM Transactions on Computational Logic 
-
ISSN: 
1529-3785
-
Date (published): 
31-Oct-2017
-
Number of Pages: 
20
-
Publisher: 
ASSOC COMPUTING MACHINERY
-
Peer reviewed: 
Yes
-
Keywords: 
Theoretical Computer Science; General Computer Science; Computational Mathematics; Logic
-
Research Areas: 
außerhalb der gesamtuniversitären Forschungsschwerpunkte: 100%
-
Science Branch: 
Mathematik
-
Appears in Collections:
Article

Show full item record

Page view(s)

58
checked on Dec 1, 2023

Google ScholarTM

Check