{"id":"https://openalex.org/W2104508205","doi":"https://doi.org/10.1007/978-3-540-70918-3_31","title":"A Search Algorithm for the Maximal Attractor of a Cellular Automaton","display_name":"A Search Algorithm for the Maximal Attractor of a Cellular Automaton","publication_year":2007,"publication_date":"2007-05-23","ids":{"openalex":"https://openalex.org/W2104508205","doi":"https://doi.org/10.1007/978-3-540-70918-3_31","mag":"2104508205"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-70918-3_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70918-3_31","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080631835","display_name":"Enrico Formenti","orcid":"https://orcid.org/0000-0002-1007-7912"},"institutions":[{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Enrico Formenti","raw_affiliation_strings":["Laboratoire I3S, Universit\u00e9 de Nice Sophia Antipolis, 2000, route des Lucioles, Les Algorithmes - b\u00e2t Euclide B, BP 121, 06903 Sophia Antipolis - Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire I3S, Universit\u00e9 de Nice Sophia Antipolis, 2000, route des Lucioles, Les Algorithmes - b\u00e2t Euclide B, BP 121, 06903 Sophia Antipolis - Cedex, France","institution_ids":["https://openalex.org/I201841394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037929944","display_name":"Petr K\u016frka","orcid":"https://orcid.org/0000-0002-1417-041X"},"institutions":[{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ","FR"],"is_corresponding":false,"raw_author_name":"Petr K\u016frka","raw_affiliation_strings":["Laboratoire I3S, Universit\u00e9 de Nice Sophia Antipolis, 2000, route des Lucioles, Les Algorithmes - b\u00e2t Euclide B, BP 121, 06903 Sophia Antipolis - Cedex, France","Center for Theoretical Study, Charles University in Prague, Jilsk\u00e1 1, CZ-11000 Praha 1, Czechia,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire I3S, Universit\u00e9 de Nice Sophia Antipolis, 2000, route des Lucioles, Les Algorithmes - b\u00e2t Euclide B, BP 121, 06903 Sophia Antipolis - Cedex, France","institution_ids":["https://openalex.org/I201841394"]},{"raw_affiliation_string":"Center for Theoretical Study, Charles University in Prague, Jilsk\u00e1 1, CZ-11000 Praha 1, Czechia,","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0434,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.87462144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"356","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","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/T12162","display_name":"Cellular Automata and Applications","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/T10588","display_name":"Mathematical Dynamics and Fractals","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9904999732971191,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/attractor","display_name":"Attractor","score":0.9379040002822876},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.8168743848800659},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6339313983917236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5956301689147949},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5266135931015015},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.46464893221855164},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45931321382522583},{"id":"https://openalex.org/keywords/limit-set","display_name":"Limit set","score":0.41004806756973267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39870685338974},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3829181492328644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29019272327423096},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27811262011528015},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08225366473197937}],"concepts":[{"id":"https://openalex.org/C164380108","wikidata":"https://www.wikidata.org/wiki/Q507187","display_name":"Attractor","level":2,"score":0.9379040002822876},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.8168743848800659},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6339313983917236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5956301689147949},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5266135931015015},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.46464893221855164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45931321382522583},{"id":"https://openalex.org/C51337361","wikidata":"https://www.wikidata.org/wiki/Q1825444","display_name":"Limit set","level":3,"score":0.41004806756973267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39870685338974},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3829181492328644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29019272327423096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27811262011528015},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08225366473197937},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-70918-3_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70918-3_31","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:HAL:hal-00310850v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00310850","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science (STACS'07), Feb 2007, Aachen, Germany. pp.356-366","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1565611252","https://openalex.org/W1979132671","https://openalex.org/W2001478940","https://openalex.org/W2008835979","https://openalex.org/W2010548963","https://openalex.org/W2023873787","https://openalex.org/W2055719260","https://openalex.org/W2064475448","https://openalex.org/W2889746687","https://openalex.org/W4206252072","https://openalex.org/W4206805073"],"related_works":["https://openalex.org/W1988341053","https://openalex.org/W2753479176","https://openalex.org/W3186780583","https://openalex.org/W2354446422","https://openalex.org/W168202189","https://openalex.org/W4386185373","https://openalex.org/W2050682984","https://openalex.org/W758866804","https://openalex.org/W3163354659","https://openalex.org/W1991117052"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}