Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers

DOI10.1007/978-3-642-15488-1_34zbMath1291.68209OpenAlexW1535804477MaRDI QIDQ3588394

Mitsuo Wakatsuki, Etsuji Tomita

Publication date: 10 September 2010

Published in: Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15488-1_34

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

This page was built for publication: Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers