Inferring finite transducers
Autor(a) principal: | |
---|---|
Data de Publicação: | 2003 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Journal of the Brazilian Computer Society |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002003000200001 |
Resumo: | We consider the inference problem for finite transducers using different kinds of samples (positive and negative samples, positive samples only, and structural samples). Given pairs of input and output words, our task is to infer the finite transducer consistent with the given pairs. We show that this problem can be solved in certain special cases by using known results on the inference problem for linear languages. |
id |
UFRGS-28_2c661524bbf6d7a3ddd182cbc566a96b |
---|---|
oai_identifier_str |
oai:scielo:S0104-65002003000200001 |
network_acronym_str |
UFRGS-28 |
network_name_str |
Journal of the Brazilian Computer Society |
repository_id_str |
|
spelling |
Inferring finite transducersFormal languagesinductive inferencefinite transducerslinear languagesWe consider the inference problem for finite transducers using different kinds of samples (positive and negative samples, positive samples only, and structural samples). Given pairs of input and output words, our task is to infer the finite transducer consistent with the given pairs. We show that this problem can be solved in certain special cases by using known results on the inference problem for linear languages.Sociedade Brasileira de Computação2003-11-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002003000200001Journal of the Brazilian Computer Society v.9 n.1 2003reponame:Journal of the Brazilian Computer Societyinstname:Sociedade Brasileira de Computação (SBC)instacron:UFRGS10.1590/S0104-65002003000200001info:eu-repo/semantics/openAccessMäkinen,Erkkieng2004-09-14T00:00:00Zoai:scielo:S0104-65002003000200001Revistahttps://journal-bcs.springeropen.com/PUBhttps://old.scielo.br/oai/scielo-oai.phpjbcs@icmc.sc.usp.br1678-48040104-6500opendoar:2004-09-14T00:00Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)false |
dc.title.none.fl_str_mv |
Inferring finite transducers |
title |
Inferring finite transducers |
spellingShingle |
Inferring finite transducers Mäkinen,Erkki Formal languages inductive inference finite transducers linear languages |
title_short |
Inferring finite transducers |
title_full |
Inferring finite transducers |
title_fullStr |
Inferring finite transducers |
title_full_unstemmed |
Inferring finite transducers |
title_sort |
Inferring finite transducers |
author |
Mäkinen,Erkki |
author_facet |
Mäkinen,Erkki |
author_role |
author |
dc.contributor.author.fl_str_mv |
Mäkinen,Erkki |
dc.subject.por.fl_str_mv |
Formal languages inductive inference finite transducers linear languages |
topic |
Formal languages inductive inference finite transducers linear languages |
description |
We consider the inference problem for finite transducers using different kinds of samples (positive and negative samples, positive samples only, and structural samples). Given pairs of input and output words, our task is to infer the finite transducer consistent with the given pairs. We show that this problem can be solved in certain special cases by using known results on the inference problem for linear languages. |
publishDate |
2003 |
dc.date.none.fl_str_mv |
2003-11-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002003000200001 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002003000200001 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0104-65002003000200001 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Computação |
publisher.none.fl_str_mv |
Sociedade Brasileira de Computação |
dc.source.none.fl_str_mv |
Journal of the Brazilian Computer Society v.9 n.1 2003 reponame:Journal of the Brazilian Computer Society instname:Sociedade Brasileira de Computação (SBC) instacron:UFRGS |
instname_str |
Sociedade Brasileira de Computação (SBC) |
instacron_str |
UFRGS |
institution |
UFRGS |
reponame_str |
Journal of the Brazilian Computer Society |
collection |
Journal of the Brazilian Computer Society |
repository.name.fl_str_mv |
Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC) |
repository.mail.fl_str_mv |
jbcs@icmc.sc.usp.br |
_version_ |
1754734669593575424 |