{"id":"https://openalex.org/W2965996947","doi":"https://doi.org/10.1007/978-3-030-25540-4_1","title":"Symbolic Register Automata","display_name":"Symbolic Register Automata","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2965996947","doi":"https://doi.org/10.1007/978-3-030-25540-4_1","mag":"2965996947"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-25540-4_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-25540-4_1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-25540-4_1.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-25540-4_1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089920000","display_name":"Loris D\u2019Antoni","orcid":"https://orcid.org/0000-0001-9625-4037"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Loris D\u2019Antoni","raw_affiliation_strings":["University of Wisconsin\u2013Madison, Madison, WI, 53706-1685, USA"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin\u2013Madison, Madison, WI, 53706-1685, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038437346","display_name":"Tiago Ferreira","orcid":"https://orcid.org/0000-0002-6942-0228"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tiago Ferreira","raw_affiliation_strings":["University College London, Gower Street, London, WC1E 6BT, UK"],"affiliations":[{"raw_affiliation_string":"University College London, Gower Street, London, WC1E 6BT, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021533181","display_name":"Matteo Sammartino","orcid":"https://orcid.org/0000-0003-1456-2242"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matteo Sammartino","raw_affiliation_strings":["University College London, Gower Street, London, WC1E 6BT, UK"],"affiliations":[{"raw_affiliation_string":"University College London, Gower Street, London, WC1E 6BT, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100658822","display_name":"Alexandra Silva","orcid":"https://orcid.org/0000-0001-5014-9784"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alexandra Silva","raw_affiliation_strings":["University College London, Gower Street, London, WC1E 6BT, UK"],"affiliations":[{"raw_affiliation_string":"University College London, Gower Street, London, WC1E 6BT, UK","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5089920000"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":3.9127,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.93823147,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983999729156494,"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.7659862637519836},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.734701931476593},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.5682515501976013},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.5363873839378357},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5322287678718567},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5212593674659729},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5119091272354126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.500957727432251},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5007476806640625},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4735160171985626},{"id":"https://openalex.org/keywords/register","display_name":"Register (sociolinguistics)","score":0.4644726514816284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.369932621717453},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.303924024105072},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1688399314880371}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7659862637519836},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.734701931476593},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.5682515501976013},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.5363873839378357},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5322287678718567},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5212593674659729},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5119091272354126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.500957727432251},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5007476806640625},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4735160171985626},{"id":"https://openalex.org/C2779235478","wikidata":"https://www.wikidata.org/wiki/Q286576","display_name":"Register (sociolinguistics)","level":2,"score":0.4644726514816284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.369932621717453},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.303924024105072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1688399314880371},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-25540-4_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-25540-4_1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-25540-4_1.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"mag:2900962466","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1811.06968","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10074295","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10074295/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In: Dillig, I and Tasiran, S, (eds.) International Conference on Computer Aided Verification, CAV 2019. Lecture Notes in Computer Science, vol 11561.    Springer: Cham. (2019)     ","raw_type":"Proceedings paper"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-25540-4_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-25540-4_1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-25540-4_1.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G2853020368","display_name":"CAREER: Program Synthesis with Quantitative Guarantees","funder_award_id":"1750965","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7012524314","display_name":null,"funder_award_id":"Prize","funder_id":"https://openalex.org/F4320319993","funder_display_name":"Leverhulme Trust"},{"id":"https://openalex.org/G7530915210","display_name":"NeTS: Medium: Collaborative research: Automatic Network Repair","funder_award_id":"1763871","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2965996947.pdf","grobid_xml":"https://content.openalex.org/works/W2965996947.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W82980056","https://openalex.org/W830367993","https://openalex.org/W1477170694","https://openalex.org/W1494143614","https://openalex.org/W1587163902","https://openalex.org/W1686574681","https://openalex.org/W1795569145","https://openalex.org/W1975016340","https://openalex.org/W2026388351","https://openalex.org/W2035955066","https://openalex.org/W2046160374","https://openalex.org/W2056665285","https://openalex.org/W2081396910","https://openalex.org/W2096202696","https://openalex.org/W2111990320","https://openalex.org/W2132281483","https://openalex.org/W2141607151","https://openalex.org/W2157260510","https://openalex.org/W2177814128","https://openalex.org/W2213779776","https://openalex.org/W2676873924","https://openalex.org/W2884635497","https://openalex.org/W2889196489","https://openalex.org/W2963214527","https://openalex.org/W3000487173","https://openalex.org/W3099647739","https://openalex.org/W3104994285"],"related_works":["https://openalex.org/W4386400090","https://openalex.org/W4382203044","https://openalex.org/W4310283533","https://openalex.org/W2169203237","https://openalex.org/W2368684504","https://openalex.org/W4285173356","https://openalex.org/W3147849782","https://openalex.org/W1978638999","https://openalex.org/W2321667159","https://openalex.org/W2173305072"],"abstract_inverted_index":{"Symbolic":[0,56],"Finite":[1],"Automata":[2,5],"and":[3,43,68,86,92],"Register":[4,57],"are":[6],"two":[7],"orthogonal":[8],"extensions":[9],"of":[10,80],"finite":[11],"automata":[12,24,38],"motivated":[13],"by":[14],"real-world":[15],"problems":[16],"where":[17],"data":[18],"may":[19],"have":[20,40,44],"unbounded":[21],"domains.":[22],"These":[23],"address":[25],"a":[26,29,59,72],"demand":[27],"for":[28,89],"model":[30,61],"over":[31],"large":[32],"or":[33],"infinite":[34],"alphabets,":[35],"respectively.":[36],"Both":[37],"models":[39],"interesting":[41],"applications":[42,75],"been":[45],"successful":[46],"in":[47],"their":[48,84],"own":[49],"right.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"introduce":[55],"Automata,":[58],"new":[60],"that":[62,76],"combines":[63],"features":[64],"from":[65],"both":[66],"symbolic":[67],"register":[69],"automata,":[70],"with":[71,96],"view":[73],"on":[74],"were":[77],"previously":[78],"out":[79],"reach.":[81],"We":[82],"study":[83],"properties":[85],"provide":[87],"algorithms":[88],"emptiness,":[90],"inclusion":[91],"equivalence":[93],"checking,":[94],"together":[95],"experimental":[97],"results.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}