scientific article; zbMATH DE number 7315101

zbMATH Open1455.68096arXiv1008.1658MaRDI QIDQ4964022

Xiaoxue Piao, Kai Salomaa

Publication date: 24 February 2021

Full work available at URL: https://arxiv.org/abs/1008.1658

Title of this publication is not available (Why is that?)

zbMATH Keywords

tree automatanondeterminismstate complexityunranked trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Automata for unordered trees 👍 👎
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems 👍 👎
• On ground tree transformations and congruences induced by tree automata. 👍 👎
• Transformations Between Different Models of Unranked Bottom-Up Tree Automata 👍 👎
• Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees 👍 👎
• Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers 👍 👎
• Bottom-up tree pushdown automata and rewrite systems 👍 👎
• Fundamentals of Computation Theory 👍 👎
• Term Rewriting and Applications 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964022)