The complexity of optimizing finite-state transducers

DOI10.1016/0304-3975(94)90032-9zbMath0830.68047OpenAlexW2095138465MaRDI QIDQ1329734

Craig A. Rich, Giora Slutzki

Publication date: 28 January 1996

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90032-9

zbMATH Keywords

alternation hierarchyexotic matrix calculusmetric Turing machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of optimization problems
• Nondeterministic Space is Closed under Complementation
• Alternation

This page was built for publication: The complexity of optimizing finite-state transducers