{"id":"https://openalex.org/W1587826772","doi":"https://doi.org/10.1007/3-540-45790-9_7","title":"Learning Probabilistic Residual Finite State Automata","display_name":"Learning Probabilistic Residual Finite State Automata","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1587826772","doi":"https://doi.org/10.1007/3-540-45790-9_7","mag":"1587826772"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45790-9_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45790-9_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083096878","display_name":"Yann Esposito","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115196","display_name":"Laboratoire d\u2019Informatique Fondamentale de Marseille","ror":"https://ror.org/022my8t07","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I21491767","https://openalex.org/I4210115196","https://openalex.org/I4210142724","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yann Esposito","raw_affiliation_strings":["LIF, UMR 6166, Universit\u00e9 de Provence, Marseille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIF, UMR 6166, Universit\u00e9 de Provence, Marseille, France","institution_ids":["https://openalex.org/I4210115196"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044330058","display_name":"Aur\u00e9lien Lemay","orcid":null},"institutions":[{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Aur\u00e9lien Lemay","raw_affiliation_strings":["GRAPPA-LIFL, Universit\u00e9 de Lille, Lille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GRAPPA-LIFL, Universit\u00e9 de Lille, Lille, France","institution_ids":["https://openalex.org/I174424907","https://openalex.org/I2279609970"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108423452","display_name":"Fran\u00e7ois Denis","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115196","display_name":"Laboratoire d\u2019Informatique Fondamentale de Marseille","ror":"https://ror.org/022my8t07","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I21491767","https://openalex.org/I4210115196","https://openalex.org/I4210142724","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois Denis","raw_affiliation_strings":["LIF, UMR 6166, Universit\u00e9 de Provence, Marseille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIF, UMR 6166, Universit\u00e9 de Provence, Marseille, France","institution_ids":["https://openalex.org/I4210115196"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030188873","display_name":"Pierre Dupont","orcid":"https://orcid.org/0000-0003-4835-6519"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pierre Dupont","raw_affiliation_strings":["INGI, University of Louvain, Louvain-la-Neuve, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INGI, University of Louvain, Louvain-la-Neuve, Belgium","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9653,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.87145431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"77","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.8313635587692261},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7691327333450317},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6708555221557617},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.6586551070213318},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6544585227966309},{"id":"https://openalex.org/keywords/grammar-induction","display_name":"Grammar induction","score":0.6254568696022034},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6002446413040161},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5642555952072144},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.527321994304657},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.4693649113178253},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4610215127468109},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45795783400535583},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4507009983062744},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.42634284496307373},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.42052918672561646},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41459792852401733},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4142058789730072},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3377155065536499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28129222989082336},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2721996605396271},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24603623151779175},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.14115533232688904},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14106568694114685}],"concepts":[{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.8313635587692261},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7691327333450317},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6708555221557617},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.6586551070213318},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6544585227966309},{"id":"https://openalex.org/C56601403","wikidata":"https://www.wikidata.org/wiki/Q5593673","display_name":"Grammar induction","level":3,"score":0.6254568696022034},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6002446413040161},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5642555952072144},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.527321994304657},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.4693649113178253},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4610215127468109},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45795783400535583},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4507009983062744},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.42634284496307373},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.42052918672561646},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41459792852401733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4142058789730072},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3377155065536499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28129222989082336},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2721996605396271},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24603623151779175},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.14115533232688904},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14106568694114685},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-45790-9_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45790-9_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.6820","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6820","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.info.ucl.ac.be/pub/publi/2002/pdupont/icgi02_a.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.98.4907","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.4907","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lif.univ-mrs.fr/~esposito/pub/icgi2002.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.699999988079071,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W140384553","https://openalex.org/W1486103693","https://openalex.org/W1486697888","https://openalex.org/W1559171143","https://openalex.org/W1575798196","https://openalex.org/W1683541793","https://openalex.org/W2057427285","https://openalex.org/W2082863623","https://openalex.org/W2095745830","https://openalex.org/W4252836795"],"related_works":["https://openalex.org/W2950563206","https://openalex.org/W4300232377","https://openalex.org/W1550824632","https://openalex.org/W1799091054","https://openalex.org/W1587826772","https://openalex.org/W1993598446","https://openalex.org/W1767123124","https://openalex.org/W1486697888","https://openalex.org/W4297362790","https://openalex.org/W2950632552"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}