{"id":"https://openalex.org/W2482365960","doi":"https://doi.org/10.1007/978-3-319-41114-9_3","title":"Self-Verifying Finite Automata and Descriptional Complexity","display_name":"Self-Verifying Finite Automata and Descriptional Complexity","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2482365960","doi":"https://doi.org/10.1007/978-3-319-41114-9_3","mag":"2482365960"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-41114-9_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-41114-9_3","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":"gold","oa_url":"https://inria.hal.science/hal-01633958","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012840795","display_name":"Galina Jir\u00e1skov\u00e1","orcid":"https://orcid.org/0000-0001-9817-8197"},"institutions":[{"id":"https://openalex.org/I207624831","display_name":"Slovak Academy of Sciences","ror":"https://ror.org/03h7qq074","country_code":"SK","type":"funder","lineage":["https://openalex.org/I207624831"]},{"id":"https://openalex.org/I4210120676","display_name":"Mathematical Institute of the Slovak Academy of Sciences","ror":"https://ror.org/02fhy7464","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210120676"]}],"countries":["SK"],"is_corresponding":true,"raw_author_name":"Galina Jir\u00e1skov\u00e1","raw_affiliation_strings":["Mathematical Institute, Slovak Academy of Sciences, Gre\u0161\u00e1kova 6, 040 01, Ko\u0161ice, Slovakia"],"affiliations":[{"raw_affiliation_string":"Mathematical Institute, Slovak Academy of Sciences, Gre\u0161\u00e1kova 6, 040 01, Ko\u0161ice, Slovakia","institution_ids":["https://openalex.org/I207624831","https://openalex.org/I4210120676"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012840795"],"corresponding_institution_ids":["https://openalex.org/I207624831","https://openalex.org/I4210120676"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08847124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"29","last_page":"44"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9979000091552734,"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.9976999759674072,"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/computer-science","display_name":"Computer science","score":0.762222409248352},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7573296427726746},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.7411834597587585},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7060986161231995},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.6916350722312927},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.636167049407959},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.603230357170105},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.548502504825592},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5454396605491638},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.535490095615387},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.43764278292655945},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3495819568634033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31037914752960205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19446596503257751}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.762222409248352},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7573296427726746},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.7411834597587585},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7060986161231995},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.6916350722312927},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.636167049407959},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.603230357170105},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.548502504825592},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5454396605491638},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.535490095615387},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.43764278292655945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3495819568634033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31037914752960205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19446596503257751}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-41114-9_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-41114-9_3","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-01633958v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01633958","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.29-44, ⟨10.1007/978-3-319-41114-9_3⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01633958v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01633958","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.29-44, ⟨10.1007/978-3-319-41114-9_3⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1068520834","https://openalex.org/W1531381863","https://openalex.org/W1978638999","https://openalex.org/W1991409518","https://openalex.org/W1994584977","https://openalex.org/W2006629323","https://openalex.org/W2011252827","https://openalex.org/W2013568176","https://openalex.org/W2024077433","https://openalex.org/W2028979408","https://openalex.org/W2034243894","https://openalex.org/W2050154914","https://openalex.org/W2054801208","https://openalex.org/W2063230375","https://openalex.org/W2068318378","https://openalex.org/W2072453354","https://openalex.org/W2080108335","https://openalex.org/W2149288970","https://openalex.org/W2255673511","https://openalex.org/W2408564624","https://openalex.org/W4241604193"],"related_works":["https://openalex.org/W2537940722","https://openalex.org/W4205935260","https://openalex.org/W2368684504","https://openalex.org/W2030569822","https://openalex.org/W1975910189","https://openalex.org/W3143588635","https://openalex.org/W2000290048","https://openalex.org/W2160879187","https://openalex.org/W4386400090","https://openalex.org/W1993598446"],"abstract_inverted_index":{"We":[0],"survey":[1],"recent":[2],"results":[3],"on":[4,35],"the":[5,16,29],"descriptional":[6],"complexity":[7,30],"of":[8,18,20,31],"self-verifying":[9,21,39],"finite":[10,22,26,40],"automata.":[11,41],"In":[12],"particular,":[13],"we":[14],"discuss":[15],"cost":[17],"simulation":[19],"automata":[23],"by":[24,38],"deterministic":[25],"automata,":[27],"and":[28],"basic":[32],"regular":[33],"operations":[34],"languages":[36],"represented":[37]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}