Polynomial time identification of strict prefix deterministic finite state transducers

Authors:
Mitsuo Wakatsuki;Etsuji Tomita
Affiliations:
Graduate School of Informatics and Engineering, The University of Electro-Communications, Tokyo, Japan;Graduate School of Informatics and Engineering, The University of Electro-Communications, Tokyo, Japan
Venue:
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Year:
2010

Citing 4
Cited 2

On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

Machine Learning
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks

IEEE Transactions on Pattern Analysis and Machine Intelligence
Inductive Inference, DFAs, and Computational Complexity

AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Polynomial-time identification of very simple grammars from positive data

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data

IEICE - Transactions on Information and Systems
Polynomial-time identification of an extension of very simple grammars from positive data

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with a subclass of finite state transducers, called strict prefix deterministic finite state transducers (SPDFST's for short), and studies a problem of identifying the subclass in the limit from positive data. After providing some properties of languages accepted by SPDFST's, we showthat the class of SPDFST's is polynomial time identifiable in the limit from positive data in the sense of Yokomori.