{"id":"https://openalex.org/W1989422383","doi":"https://doi.org/10.2168/lmcs-4(1:8)2008","title":"An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet","display_name":"An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet","publication_year":2008,"publication_date":"2008-03-25","ids":{"openalex":"https://openalex.org/W1989422383","doi":"https://doi.org/10.2168/lmcs-4(1:8)2008","mag":"1989422383"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(1:8)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(1:8)2008","pdf_url":"https://lmcs.episciences.org/1202/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1202/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alexis B\u00e8s","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexis B\u00e8s","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2329,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.7947136,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"Volume 4, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.5497000217437744,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.5497000217437744,"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.27320000529289246,"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/T10142","display_name":"Formal Methods in Verification","score":0.060100000351667404,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.9110000133514404},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5934000015258789},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.5659000277519226},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.4839000105857849},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4810999929904938},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.46459999680519104},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4392000138759613}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9110000133514404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.629800021648407},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5934000015258789},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.5659000277519226},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5525000095367432},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.4839000105857849},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4810999929904938},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.46459999680519104},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3125},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.2946000099182129},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.2815000116825104},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.27320000529289246},{"id":"https://openalex.org/C203264685","wikidata":"https://www.wikidata.org/wiki/Q2328174","display_name":"Atomic formula","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2599000036716461}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-4(1:8)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(1:8)2008","pdf_url":"https://lmcs.episciences.org/1202/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0801.2498","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0801.2498","pdf_url":"https://arxiv.org/pdf/0801.2498","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":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.5593","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.5593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.univ-paris12.fr/lacl/bes/publi/FefermanVaughtAutomata.ps","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:2d9d5e5361e3453c8c39806e51995e3e","is_oa":true,"landing_page_url":"https://doaj.org/article/2d9d5e5361e3453c8c39806e51995e3e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 4, Issue 1 (2008)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(1:8)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(1:8)2008","pdf_url":"https://lmcs.episciences.org/1202/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1989422383.pdf","grobid_xml":"https://content.openalex.org/works/W1989422383.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W100744576","https://openalex.org/W1496394707","https://openalex.org/W1502573233","https://openalex.org/W1511526676","https://openalex.org/W1517606395","https://openalex.org/W2006634201","https://openalex.org/W2014246868","https://openalex.org/W2034177508","https://openalex.org/W2056665285","https://openalex.org/W2058228891","https://openalex.org/W2085467680","https://openalex.org/W2105348917","https://openalex.org/W2109287809","https://openalex.org/W2111714843","https://openalex.org/W2121408865","https://openalex.org/W2131742729","https://openalex.org/W2138856440","https://openalex.org/W2163696969","https://openalex.org/W2168838065","https://openalex.org/W2280396455","https://openalex.org/W6636397328","https://openalex.org/W6645145022","https://openalex.org/W6669276030"],"related_works":[],"abstract_inverted_index":{"We":[0,38],"show":[1],"that":[2],"a":[3,14,41],"special":[4],"case":[5],"of":[6,17,44,72],"the":[7,45],"Feferman-Vaught":[8,46],"composition":[9],"theorem":[10],"gives":[11],"rise":[12],"to":[13,50],"natural":[15],"notion":[16],"automata":[18],"for":[19,75],"finite":[20],"words":[21,76],"over":[22,77],"an":[23,78],"infinite":[24,79],"alphabet,":[25],"with":[26],"good":[27],"closure":[28],"and":[29,60],"decidability":[30,63],"properties,":[31],"as":[32,34,58],"well":[33],"several":[35],"logical":[36],"characterizations.":[37],"also":[39],"consider":[40],"slight":[42],"extension":[43],"formalism":[47],"which":[48],"allows":[49],"express":[51],"more":[52],"relations":[53],"between":[54],"component":[55],"values":[56],"(such":[57],"equality),":[59],"prove":[61],"related":[62],"results.":[64],"From":[65],"this":[66],"result":[67],"we":[68],"get":[69],"new":[70],"classes":[71],"decidable":[73],"logics":[74],"alphabet.":[80]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}