Tree-Transducers and Syntax-Connected Transductions

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-07407-4_21
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

The Suffix Tree of a Tree and Minimizing Sequential Transducers

BRICS Report Series
1995English

Decision Problems of Tree Transducers With Origin

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2018English

Towards Practical Typechecking for Macro Tree Transducers

English

A Survey on Decidable Equivalence Problems for Tree Transducers

International Journal of Foundations of Computer Science
Computer Science
2015English

Effects of Syntax on Running Memory Span D for Connected Discourse

Psychonomic Science
1970English

An Overview of Probabilistic Tree Transducers for Natural Language Processing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

The Translation Power of Top-Down Tree-To-Graph Transducers

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1994English

Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1994English

Graph Transductions and Typological Gaps in Morphological Paradigms

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy