A unified framework for disambiguating finite transductions

DOI10.1016/0304-3975(89)90068-6zbMath0664.68080OpenAlexW2003159515MaRDI QIDQ1115635

J. Howard Johnson

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90068-6

zbMATH Keywords

*-semiring automatonfinite state transductions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semirings (16Y60) General commutative ring theory (13A99)

Related Items

Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization

Cites Work

• Transitive closure and related semiring properties via eliminants
• Algebraic structures for transitive closure
• Sur une variante des fonctions séquentielles
• Single-valued a-transducers
• Optimization of LR(k) parsers
• Regular Algebra Applied to Path-finding Problems
• On Relations Defined by Generalized Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item