{"id":"https://openalex.org/W7167850424","doi":"https://doi.org/10.4230/lipics.lics.2026.24","title":"Layered Automata: A Canonical Model for Automata over Infinite Words","display_name":"Layered Automata: A Canonical Model for Automata over Infinite Words","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7167850424","doi":"https://doi.org/10.4230/lipics.lics.2026.24"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26811","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.LICS.2026.24","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol380-lics2026/LIPIcs.LICS.2026.24/LIPIcs.LICS.2026.24.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol380-lics2026/LIPIcs.LICS.2026.24/LIPIcs.LICS.2026.24.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027601687","display_name":"Antonio Casares","orcid":"https://orcid.org/0000-0002-6539-2020"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]},{"id":"https://openalex.org/I2802076133","display_name":"University of Koblenz and Landau","ror":"https://ror.org/01j9f6752","country_code":"DE","type":"education","lineage":["https://openalex.org/I2802076133"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Casares, Antonio","raw_affiliation_strings":["University of Kaiserslautern-Landau, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6539-2020","affiliations":[{"raw_affiliation_string":"University of Kaiserslautern-Landau, Germany","institution_ids":["https://openalex.org/I153267046","https://openalex.org/I2802076133"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021229064","display_name":"Christof L\u00f6ding","orcid":"https://orcid.org/0000-0002-1529-2806"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"L\u00f6ding, Christof","raw_affiliation_strings":["RWTH Aachen University, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1529-2806","affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064757019","display_name":"Igor Walukiewicz","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Walukiewicz, Igor","raw_affiliation_strings":["CNRS, Bordeaux University, Talence, France"],"raw_orcid":"https://orcid.org/0000-0001-8952-7201","affiliations":[{"raw_affiliation_string":"CNRS, Bordeaux University, Talence, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.87698736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5737000107765198,"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.5737000107765198,"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.2662000060081482,"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.06279999762773514,"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/automaton","display_name":"Automaton","score":0.6825000047683716},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.593500018119812},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5052000284194946},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4366999864578247},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4336000084877014},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.42100000381469727},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.3977999985218048},{"id":"https://openalex.org/keywords/canonical-form","display_name":"Canonical form","score":0.391400009393692}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6825000047683716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6514999866485596},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.593500018119812},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5156999826431274},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5052000284194946},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4366999864578247},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4336000084877014},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.42100000381469727},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.3977999985218048},{"id":"https://openalex.org/C204707403","wikidata":"https://www.wikidata.org/wiki/Q1152398","display_name":"Canonical form","level":2,"score":0.391400009393692},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.3619999885559082},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3359000086784363},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.33469998836517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33250001072883606},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.314300000667572},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.3061999976634979},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.2939999997615814},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.29159998893737793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2770000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26811","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.LICS.2026.24","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol380-lics2026/LIPIcs.LICS.2026.24/LIPIcs.LICS.2026.24.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.lics.2026.24","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.lics.2026.24","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26811","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.LICS.2026.24","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol380-lics2026/LIPIcs.LICS.2026.24/LIPIcs.LICS.2026.24.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6753724813461304,"display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G7273138714","display_name":"Gerichtete ramseysche Quantoren mit Anwendungen in der formalen Verifikation","funder_award_id":"522843867","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320323873","display_name":"Uniwersytet Warszawski","ror":"https://ror.org/039bjqg32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7167850424.pdf","grobid_xml":"https://content.openalex.org/works/W7167850424.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,26,58],"introduce":[1],"layered":[2,39,54,63,84],"automata,":[3,64,81],"a":[4,15,35,87],"subclass":[5],"of":[6],"alternating":[7],"parity":[8],"automata":[9,19,85],"that":[10,28,42],"generalises":[11],"deterministic":[12,22,56,79],"automata.":[13],"Assuming":[14],"consistency":[16,66],"property,":[17],"these":[18],"are":[20],"history":[21],"and":[23,41,68],"0-1":[24],"probabilistic.":[25],"show":[27],"every":[29,53],"omega-regular":[30],"language":[31],"is":[32],"recognised":[33],"by":[34],"unique":[36],"minimal":[37,82],"consistent":[38,83],"automaton,":[40],"this":[43],"canonical":[44],"form":[45],"can":[46,71],"be":[47,72],"computed":[48],"in":[49,74],"polynomial":[50,75],"time":[51],"from":[52],"or":[55],"automaton.":[57],"further":[59],"establish":[60],"that,":[61],"for":[62],"both":[65],"checking":[67],"inclusion":[69],"testing":[70],"performed":[73],"time.":[76],"Much":[77],"like":[78],"finite":[80],"admit":[86],"characterisation":[88],"based":[89],"on":[90],"congruences.":[91]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2026-07-10T00:00:00"}