Compressed Tree Canonization (Q3449487)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Compressed Tree Canonization	scientific article

Statements

scholarly article

0 references

Compressed Tree Canonization (English)

0 references

0 references

Sebastian Maneth

0 references

Fabian Peternek

0 references

Automata, Languages, and Programming

0 references

publication date

4 November 2015

0 references

full work available at URL

https://arxiv.org/abs/1502.04625

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Deciding bisimilarity is P-complete

0 references

A Comparison of Succinctly Represented Finite-State Systems

0 references

0 references

The Smallest Grammar Problem

0 references

Succinct Encodings of Graph Isomorphism

0 references

Succinct representations of graphs

0 references

Completeness results for graph isomorphism.

0 references

The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems

0 references

Algorithmics on SLP-compressed strings: A survey

0 references

Compressed Tree Canonization

0 references

Parameter reduction and automata evaluation for grammar-compressed trees

0 references

Isomorphism of regular trees and words

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-47666-6_27

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3449487

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3449487&oldid=36210928"