{"id":"https://openalex.org/W2056665285","doi":"https://doi.org/10.1145/1013560.1013562","title":"Finite state machines for strings over infinite alphabets","display_name":"Finite state machines for strings over infinite alphabets","publication_year":2004,"publication_date":"2004-07-01","ids":{"openalex":"https://openalex.org/W2056665285","doi":"https://doi.org/10.1145/1013560.1013562","mag":"2056665285"},"language":"en","primary_location":{"id":"doi:10.1145/1013560.1013562","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1013560.1013562","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","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/A5022264843","display_name":"Frank Neven","orcid":"https://orcid.org/0000-0002-7143-1903"},"institutions":[{"id":"https://openalex.org/I4210127597","display_name":"Transnational University Limburg","ror":"https://ror.org/02xyaf767","country_code":"BE","type":"education","lineage":["https://openalex.org/I4210127597"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Frank Neven","raw_affiliation_strings":["Limburgs Universitair Centrum, Diepenbeek, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Limburgs Universitair Centrum, Diepenbeek, Belgium","institution_ids":["https://openalex.org/I4210127597"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031710345","display_name":"Thomas Schwentick","orcid":"https://orcid.org/0000-0002-1062-922X"},"institutions":[{"id":"https://openalex.org/I161103922","display_name":"Philipps University of Marburg","ror":"https://ror.org/01rdrb571","country_code":"DE","type":"education","lineage":["https://openalex.org/I161103922"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Schwentick","raw_affiliation_strings":["Philipps-Universit\u00e4t Marburg, Marburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Philipps-Universit\u00e4t Marburg, Marburg, Germany","institution_ids":["https://openalex.org/I161103922"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049457012","display_name":"Victor Vianu","orcid":"https://orcid.org/0000-0002-0671-4456"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Victor Vianu","raw_affiliation_strings":["University of California, San Diego, La Jolla, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.2677,"has_fulltext":false,"cited_by_count":273,"citation_normalized_percentile":{"value":0.97453119,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"5","issue":"3","first_page":"403","last_page":"435"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.993399977684021,"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/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5847777128219604},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5710710287094116},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5507062077522278},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.536513090133667},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.533885657787323},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5052853226661682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.493172824382782},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4752602279186249},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.45249128341674805},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4509895443916321},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4428143799304962},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.42955300211906433},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.41663509607315063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41153183579444885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24998310208320618}],"concepts":[{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5847777128219604},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5710710287094116},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5507062077522278},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.536513090133667},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.533885657787323},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5052853226661682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.493172824382782},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4752602279186249},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.45249128341674805},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4509895443916321},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4428143799304962},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.42955300211906433},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.41663509607315063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41153183579444885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24998310208320618}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1013560.1013562","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1013560.1013562","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.3039","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.3039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://alpha.luc.ac.be/~fneven/papers/infinitetocl.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.9377","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.9377","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://alpha.luc.ac.be/~lucg5503/infinitefull.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.7550","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cse.ucsd.edu/users/vianu/PAPERS/mfcs-tocl02.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W421997344","https://openalex.org/W1497287285","https://openalex.org/W1527664624","https://openalex.org/W1535627680","https://openalex.org/W1558832481","https://openalex.org/W1579407214","https://openalex.org/W1583633027","https://openalex.org/W1747717485","https://openalex.org/W1816184685","https://openalex.org/W1816620374","https://openalex.org/W1964306497","https://openalex.org/W1970599921","https://openalex.org/W1971842919","https://openalex.org/W1975698236","https://openalex.org/W1977578205","https://openalex.org/W1978405212","https://openalex.org/W1980407366","https://openalex.org/W1982169430","https://openalex.org/W1989382950","https://openalex.org/W1990483472","https://openalex.org/W1995362929","https://openalex.org/W2002089154","https://openalex.org/W2026114145","https://openalex.org/W2028357390","https://openalex.org/W2029764918","https://openalex.org/W2029872977","https://openalex.org/W2031470081","https://openalex.org/W2045916776","https://openalex.org/W2061628264","https://openalex.org/W2063323989","https://openalex.org/W2069436890","https://openalex.org/W2078015341","https://openalex.org/W2081396910","https://openalex.org/W2090567381","https://openalex.org/W2091843304","https://openalex.org/W2096202696","https://openalex.org/W2142151475","https://openalex.org/W2158535500","https://openalex.org/W2293579690","https://openalex.org/W2401216365","https://openalex.org/W2561675875","https://openalex.org/W2748837517","https://openalex.org/W3157585079","https://openalex.org/W4241108585","https://openalex.org/W4254031789","https://openalex.org/W6634622667","https://openalex.org/W6638352968","https://openalex.org/W6673597620"],"related_works":["https://openalex.org/W2537940722","https://openalex.org/W4205935260","https://openalex.org/W2368684504","https://openalex.org/W2037872771","https://openalex.org/W2462239665","https://openalex.org/W1987608226","https://openalex.org/W3153637812","https://openalex.org/W4231358735","https://openalex.org/W2124370744","https://openalex.org/W2171527505"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"formal":[2],"models":[3],"recently":[4],"proposed":[5],"in":[6],"the":[7,31,74,79,85],"context":[8],"of":[9,25,46,56,78,94,100],"XML,":[10],"we":[11,38,58],"study":[12],"automata":[13,27,80],"and":[14,28,41,44,49,61,69,76,81,102],"logics":[15,29],"on":[16,34,104],"strings":[17],"over":[18],"infinite":[19],"alphabets.":[20,36],"These":[21],"are":[22],"conservative":[23],"extensions":[24,45],"classical":[26],"defining":[30],"regular":[32],"languages":[33],"finite":[35],"Specifically,":[37],"consider":[39,59],"register":[40,105],"pebble":[42],"automata,":[43],"first-order":[47],"logic":[48],"monadic":[50],"second-order":[51],"logic.":[52],"For":[53],"each":[54],"type":[55],"automaton":[57],"one-way":[60],"two-way":[62],"variants,":[63],"as":[64,66,87,89],"well":[65,88],"deterministic,":[67],"nondeterministic,":[68],"alternating":[70],"control.":[71],"We":[72],"investigate":[73],"expressiveness":[75],"complexity":[77],"their":[82],"connection":[83],"to":[84],"logics,":[86],"standard":[90],"decision":[91],"problems.":[92],"Some":[93],"our":[95],"results":[96],"answer":[97],"open":[98],"questions":[99],"Kaminski":[101],"Francez":[103],"automata.":[106]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":15}],"updated_date":"2026-08-12T07:12:00.856984","created_date":"2025-10-10T00:00:00"}