Polynomial time identification of strict prefix deterministic finite state transducers

DOI10.1007/978-3-642-15488-1_34MaRDI QIDQ3588394zbMATH OpenOpenAlexFDO

Authors 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) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• On polynomial-time learnability in the limit of strictly deterministic automata
• Polynomial-time identification of very simple grammars from positive data.
• scientific article; zbMATH DE number 996379
• Grammatical Inference: Algorithms and Applications
• FINITELY SUBSEQUENTIAL TRANSDUCERS

Cited in

(3)

• Exact DFA Identification Using SAT Solvers
• Grammatical Inference: Algorithms and Applications
• Finite state transducers with predicates and identities

This page was built for publication: Polynomial time identification of strict prefix deterministic finite state transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588394)