{"id":"https://openalex.org/W1737601775","doi":"https://doi.org/10.3233/fi-2013-802","title":"Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata","display_name":"Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1737601775","doi":"https://doi.org/10.3233/fi-2013-802","mag":"1737601775"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2013-802","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2013-802","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","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/A5032164630","display_name":"Zden\u011bk Sawa","orcid":null},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Zden\u011bk Sawa","raw_affiliation_strings":["Center for Applied Cybernetics, Department of Computer Science, Technical University of Ostrava, 17. listopadu 15, Ostrava-Poruba, 708 33, Czech Republic. zdenek.sawa@vsb.cz"],"affiliations":[{"raw_affiliation_string":"Center for Applied Cybernetics, Department of Computer Science, Technical University of Ostrava, 17. listopadu 15, Ostrava-Poruba, 708 33, Czech Republic. zdenek.sawa@vsb.cz","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032164630"],"corresponding_institution_ids":["https://openalex.org/I142208455"],"apc_list":null,"apc_paid":null,"fwci":1.8127,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84223221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"123","issue":"1","first_page":"97","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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/T11567","display_name":"semigroups and automata theory","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/T12029","display_name":"DNA and Biological Computing","score":0.9933000206947327,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.992900013923645,"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/unary-operation","display_name":"Unary operation","score":0.9569302797317505},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.7889906764030457},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.7153125405311584},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6506770849227905},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6375452876091003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5794963836669922},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5391777753829956},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5204058885574341},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4907287359237671},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4866953194141388},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3748108148574829},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29533252120018005},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2652062773704529},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.165409117937088},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1514604091644287},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.12377667427062988}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.9569302797317505},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7889906764030457},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.7153125405311584},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6506770849227905},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6375452876091003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5794963836669922},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5391777753829956},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5204058885574341},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4907287359237671},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4866953194141388},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3748108148574829},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29533252120018005},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2652062773704529},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.165409117937088},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1514604091644287},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.12377667427062988},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2013-802","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2013-802","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1563342424","https://openalex.org/W1659549423","https://openalex.org/W1971747251","https://openalex.org/W2004542062","https://openalex.org/W2040161039","https://openalex.org/W2074307142","https://openalex.org/W2118382442","https://openalex.org/W2148775051","https://openalex.org/W2157390113","https://openalex.org/W2397246836","https://openalex.org/W2407531803"],"related_works":["https://openalex.org/W2054446598","https://openalex.org/W4232890137","https://openalex.org/W1981823970","https://openalex.org/W1945859206","https://openalex.org/W2772918710","https://openalex.org/W2095282951","https://openalex.org/W22759520","https://openalex.org/W2059979350","https://openalex.org/W2488819432","https://openalex.org/W2407531803"],"abstract_inverted_index":{"In":[0],"languages":[1],"over":[2,28],"a":[3,29,39],"unary":[4,30],"alphabet,":[5],"i.e.,":[6],"an":[7],"alphabet":[8,31],"with":[9,17],"only":[10],"one":[11],"letter,":[12],"words":[13],"can":[14,32],"be":[15,33],"identified":[16],"their":[18],"lengths.":[19],"It":[20],"is":[21],"well":[22],"known":[23],"that":[24],"each":[25],"regular":[26],"language":[27],"represented":[34],"as":[35],"the":[36],"union":[37],"of":[38,42],"finite":[40],"number":[41],"arithmetic":[43]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}