{"id":"https://openalex.org/W2466376928","doi":"https://doi.org/10.1007/978-3-662-49630-5_15","title":"Synchronizing Automata over Nested Words","display_name":"Synchronizing Automata over Nested Words","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2466376928","doi":"https://doi.org/10.1007/978-3-662-49630-5_15","mag":"2466376928"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-49630-5_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-49630-5_15","pdf_url":null,"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":null,"license_id":null,"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":"green","oa_url":"https://hal.archives-ouvertes.fr/hal-02411524/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082872998","display_name":"Dmitry Chistikov","orcid":"https://orcid.org/0000-0001-9055-918X"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dmitry Chistikov","raw_affiliation_strings":["Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004143083","display_name":"Pavel Martyugin","orcid":null},"institutions":[{"id":"https://openalex.org/I130823665","display_name":"Ural Federal University","ror":"https://ror.org/00hs7dr46","country_code":"RU","type":"education","lineage":["https://openalex.org/I130823665"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Pavel Martyugin","raw_affiliation_strings":["Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I130823665"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005502598","display_name":"Mahsa Shirmohammadi","orcid":"https://orcid.org/0000-0002-7779-2339"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mahsa Shirmohammadi","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082872998"],"corresponding_institution_ids":["https://openalex.org/I4210121786"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.5061,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79744716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"252","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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.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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9950000047683716,"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/synchronizing","display_name":"Synchronizing","score":0.8633874654769897},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.7051140069961548},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6554553508758545},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5530786514282227},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5520459413528442},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5421288013458252},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.509645938873291},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.49097755551338196},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.44258520007133484},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43016746640205383},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.42423704266548157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39666053652763367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3745037913322449},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34793251752853394},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2968839406967163},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2921050488948822},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27925193309783936},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.08886396884918213}],"concepts":[{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.8633874654769897},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.7051140069961548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6554553508758545},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5530786514282227},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5520459413528442},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5421288013458252},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.509645938873291},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.49097755551338196},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.44258520007133484},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43016746640205383},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.42423704266548157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39666053652763367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3745037913322449},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34793251752853394},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2968839406967163},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2921050488948822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27925193309783936},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.08886396884918213},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-49630-5_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-49630-5_15","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:elar.urfu.ru:10995/102274","is_oa":true,"landing_page_url":"https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961712561&doi=10.1007%2f978-3-662-49630-5_15&partnerID=40&md5=074c9005e176c70da484c2d70160971c","pdf_url":"https://hal.archives-ouvertes.fr/hal-02411524/document","source":{"id":"https://openalex.org/S4406922546","display_name":"Electronic Archive of Ural Federal University (ELAR UrFU)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:elar.urfu.ru:10995/102274","is_oa":true,"landing_page_url":"https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961712561&doi=10.1007%2f978-3-662-49630-5_15&partnerID=40&md5=074c9005e176c70da484c2d70160971c","pdf_url":"https://hal.archives-ouvertes.fr/hal-02411524/document","source":{"id":"https://openalex.org/S4406922546","display_name":"Electronic Archive of Ural Federal University (ELAR UrFU)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2466376928.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W31912597","https://openalex.org/W138648951","https://openalex.org/W182003119","https://openalex.org/W1486486721","https://openalex.org/W1491451231","https://openalex.org/W1532161034","https://openalex.org/W1550462819","https://openalex.org/W1564514837","https://openalex.org/W1851000371","https://openalex.org/W1892400794","https://openalex.org/W1991980356","https://openalex.org/W2008913431","https://openalex.org/W2036615169","https://openalex.org/W2039529128","https://openalex.org/W2052581866","https://openalex.org/W2062934582","https://openalex.org/W2102194201","https://openalex.org/W2102924625","https://openalex.org/W2122803069","https://openalex.org/W2131886132","https://openalex.org/W2140195055","https://openalex.org/W2147611860","https://openalex.org/W2160533854","https://openalex.org/W2344785730","https://openalex.org/W2407909453","https://openalex.org/W3100611801","https://openalex.org/W3123516944","https://openalex.org/W6610642227"],"related_works":["https://openalex.org/W3049732643","https://openalex.org/W4290017224","https://openalex.org/W1428391281","https://openalex.org/W2355522437","https://openalex.org/W2050522087","https://openalex.org/W2729254191","https://openalex.org/W2111868903","https://openalex.org/W4281261571","https://openalex.org/W3087272834","https://openalex.org/W2280116234"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}