scientific article

DOI10.4230/LIPIcs.STACS.2018.48zbMath1487.68150arXiv1702.06698MaRDI QIDQ3304147

Michael Luttenberger, Helmut Seidl, Raphaela Palenta

Publication date: 5 August 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

context-free languagescombinatorics on wordslongest common prefix

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

On the Balancedness of Tree-to-Word Transducers ⋮ Largest common prefix of a regular tree language ⋮ On the Balancedness of Tree-to-Word Transducers

Cites Work

• Unnamed Item
• Normal Form on Linear Tree-to-Word Transducers
• Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
• Algorithmics on SLP-compressed strings: A survey
• Normalization of Sequential Top-Down Tree-to-Word Transducers
• Solving Fixed-Point Equations by Derivation Tree Analysis
• Uniqueness Theorems for Periodic Functions
• Learning Sequential Tree-to-Word Transducers

This page was built for publication: