{"id":"https://openalex.org/W2076881600","doi":"https://doi.org/10.1016/j.entcs.2011.02.019","title":"Simulating Finite Eilenberg Machines with a Reactive Engine","display_name":"Simulating Finite Eilenberg Machines with a Reactive Engine","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2076881600","doi":"https://doi.org/10.1016/j.entcs.2011.02.019","mag":"2076881600"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2011.02.019","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.02.019","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.entcs.2011.02.019","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076377864","display_name":"Beno\u00eet Razet","orcid":"https://orcid.org/0009-0006-5698-9841"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Beno\u00eet Razet","raw_affiliation_strings":["School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400 005, India","School of Technology & Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400 005, India#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400 005, India","institution_ids":["https://openalex.org/I11947397"]},{"raw_affiliation_string":"School of Technology & Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400 005, India#TAB#","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076377864"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.13680944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"229","issue":"5","first_page":"119","last_page":"134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9940999746322632,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9940999746322632,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9909999966621399,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9729999899864197,"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/computer-science","display_name":"Computer science","score":0.7673556804656982},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.7126514911651611},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6865590810775757},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6750625371932983},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.6039621829986572},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5154010057449341},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4468930661678314},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4105079472064972},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.17859157919883728}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7673556804656982},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.7126514911651611},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6865590810775757},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6750625371932983},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.6039621829986572},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5154010057449341},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4468930661678314},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4105079472064972},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.17859157919883728},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.entcs.2011.02.019","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.02.019","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.595.5949","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.595.5949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pauillac.inria.fr/~razet/PDF/razet_msfp08.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2011.02.019","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.02.019","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6100000143051147,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W310661531","https://openalex.org/W1496429054","https://openalex.org/W1508641834","https://openalex.org/W1511753437","https://openalex.org/W1553511155","https://openalex.org/W1556268668","https://openalex.org/W1590800102","https://openalex.org/W2014030742","https://openalex.org/W2136678187","https://openalex.org/W4299834629","https://openalex.org/W6629836388","https://openalex.org/W6630764026","https://openalex.org/W6635427744"],"related_works":["https://openalex.org/W1991406344","https://openalex.org/W2758239419","https://openalex.org/W1972232894","https://openalex.org/W2067895928","https://openalex.org/W2950941115","https://openalex.org/W2047588061","https://openalex.org/W2280116234","https://openalex.org/W1804899877","https://openalex.org/W2108442331","https://openalex.org/W183414335"],"abstract_inverted_index":{"Eilenberg":[0,47,113,146],"machines":[1,48,114],"have":[2],"been":[3],"introduced":[4],"in":[5,7,39],"1974":[6],"the":[8,20,40,43,62,69,84,91,105,149,153],"field":[9],"of":[10,45,68,108],"formal":[11],"language":[12],"theory.":[13],"They":[14,31],"are":[15,102],"finite":[16,34,46,112,145],"automata":[17,120],"for":[18,49,160],"which":[19,50],"alphabet":[21],"is":[22,59,71,140],"interpreted":[23],"by":[24],"mathematical":[25],"relations":[26],"over":[27],"an":[28,53,94,129],"abstract":[29],"set.":[30],"generalize":[32],"many":[33],"state":[35],"machines.":[36],"We":[37],"consider":[38],"present":[41,132],"work":[42],"subclass":[44],"we":[51,131],"provide":[52],"executable":[54,95],"complete":[55,158],"simulator.":[56],"This":[57],"program":[58],"specified":[60],"using":[61,78],"Coq":[63,85],"proof":[64,86],"assistant.":[65],"The":[66,98,111],"correctness":[67],"algorithm":[70,99],"also":[72,125],"proved":[73],"formally":[74],"and":[75,100,118,122],"mechanically":[76],"verified":[77],"Coq.":[79],"Using":[80],"its":[81],"extraction":[82],"mechanism,":[83],"assistant":[87],"allows":[88],"to":[89,142],"translate":[90],"specification":[92,101],"into":[93],"OCaml":[96],"program.":[97],"inspired":[103],"from":[104],"reactive":[106,150],"engine":[107,151],"G\u00e9rard":[109],"Huet.":[110],"model":[115],"includes":[116],"deterministic":[117],"non-deterministic":[119],"(DFA":[121],"NFA)":[123],"but":[124],"real-time":[126],"transducers.":[127],"As":[128],"example,":[130],"a":[133,144,157],"pushdown":[134,154],"automaton":[135,155],"(PDA)":[136],"recognizing":[137],"ambiguous":[138],"\u03bb-terms":[139],"shown":[141],"be":[143],"machine.":[147],"Then":[148],"simulating":[152],"provides":[156],"recognizer":[159],"this":[161],"particular":[162],"context-free":[163],"language.":[164]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}