{"id":"https://openalex.org/W1988719317","doi":"https://doi.org/10.1142/s0129054112400060","title":"ORDINAL AUTOMATA AND CANTOR NORMAL FORM","display_name":"ORDINAL AUTOMATA AND CANTOR NORMAL FORM","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1988719317","doi":"https://doi.org/10.1142/s0129054112400060","mag":"1988719317"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054112400060","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400060","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5017293831","display_name":"Zolt\u00e1n \u00c9sik","orcid":null},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"ZOLT\u00c1N \u00c9SIK","raw_affiliation_strings":["Department of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r 2, Szeged, H-6720, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r 2, Szeged, H-6720, Hungary","institution_ids":["https://openalex.org/I227486990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017293831"],"corresponding_institution_ids":["https://openalex.org/I227486990"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.07906415,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"01","first_page":"87","last_page":"98"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.9995999932289124,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9954000115394592,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9860000014305115,"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/mathematics","display_name":"Mathematics","score":0.7107685208320618},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.6870346069335938},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5749917030334473},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5493568181991577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5349387526512146},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4887576103210449},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.461381733417511},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4449366331100464},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4448968470096588},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.40810927748680115},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.39629289507865906},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2503831386566162},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22708362340927124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1856151521205902},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1365286409854889}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7107685208320618},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.6870346069335938},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5749917030334473},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5493568181991577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5349387526512146},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4887576103210449},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.461381733417511},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4449366331100464},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4448968470096588},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.40810927748680115},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.39629289507865906},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2503831386566162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22708362340927124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1856151521205902},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1365286409854889}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054112400060","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400060","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W187140616","https://openalex.org/W1541737641","https://openalex.org/W1550178305","https://openalex.org/W1608752509","https://openalex.org/W1985005492","https://openalex.org/W1991735660","https://openalex.org/W2072374415","https://openalex.org/W4206503652"],"related_works":["https://openalex.org/W2810776027","https://openalex.org/W2003664089","https://openalex.org/W185868636","https://openalex.org/W2136740376","https://openalex.org/W2037872771","https://openalex.org/W2462239665","https://openalex.org/W2171527505","https://openalex.org/W1987608226","https://openalex.org/W2124370744","https://openalex.org/W2111868903"],"abstract_inverted_index":{"It":[0,63],"is":[1,6,23,67],"known":[2],"that":[3,35,65,111],"an":[4,100,109,117],"ordinal":[5,101,115],"the":[7,11,46,55,91,95],"order":[8,61],"type":[9],"of":[10,14,59,94],"lexicographic":[12,47],"ordering":[13],"a":[15,31,51,68],"regular":[16,40,81],"language":[17,41],"if":[18,21],"and":[19],"only":[20],"it":[22],"less":[24,102],"than":[25,103],"\u03c9":[26,27,104,105],".":[28],"We":[29,86],"design":[30],"polynomial":[32,69],"time":[33,70],"algorithm":[34,71,110],"constructs,":[36],"for":[37],"each":[38,113],"well-ordered":[39,80],"L":[42],"with":[43,108],"respect":[44],"to":[45,72,116],"ordering,":[48],"given":[49],"by":[50],"deterministic":[52,76],"finite":[53,77],"automaton,":[54],"Cantor":[56],"Normal":[57],"Form":[58],"its":[60],"type.":[62],"follows":[64],"there":[66],"decide":[73],"whether":[74],"two":[75],"automata":[78],"accepting":[79],"languages":[82],"accept":[83],"isomorphic":[84],"languages.":[85],"also":[87],"give":[88],"estimates":[89],"on":[90],"state":[92],"complexity":[93],"smallest":[96],"\"ordinal":[97],"automaton\"":[98],"representing":[99],",":[106],"together":[107],"translates":[112],"such":[114],"automaton.":[118]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}