Equivalences Between Ranked and Unranked Weighted Tree Automata via Binarization

doi 10.18653/v1/w16-2401
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Nested Weighted Automata

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2017English

A Weighted Hybrid Thresholding Approach for Text Binarization

International Journal of Computer Applications
2012English

Relating Word and Tree Automata

Annals of Pure and Applied Logic
Logic
2006English

On the Complexity of Semantic Equivalences for Pushdown Automata and BPA

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

General Indexation of Weighted Automata

2004English

Extracting Translation Equivalences Automatically Based on Tree-String

Information Technology Journal
2010English

Predicate Logic and Tree Automata With Tests

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Logical Characterization of Weighted Pebble Walking Automata

2014English

Hyper-Minimization for Deterministic Tree Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy