On the Balancedness of Tree-to-Word Transducers (Q5041263): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Formal properties of XML grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation tree analysis for accelerated fixed-point computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of parenthesis languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics on SLP-compressed strings: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancedness of MSO transductions in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: XML Validation for Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Pushdown Transducers with Well-Nested Outputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results on Balanced Context-Free Languages / rank
 
Normal rank

Latest revision as of 09:50, 30 July 2024

scientific article; zbMATH DE number 7601073
Language Label Description Also known as
English
On the Balancedness of Tree-to-Word Transducers
scientific article; zbMATH DE number 7601073

    Statements

    Identifiers