{"id":"https://openalex.org/W2142512881","doi":"https://doi.org/10.1142/s0129054114400115","title":"NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY","display_name":"NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2142512881","doi":"https://doi.org/10.1142/s0129054114400115","mag":"2142512881"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114400115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400115","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/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MARKUS HOLZER","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056800220","display_name":"Sebastian Jakobi","orcid":null},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"SEBASTIAN JAKOBI","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016664760"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":1.1011,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79844397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"07","first_page":"837","last_page":"855"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9947999715805054,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9922999739646912,"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/succinctness","display_name":"Succinctness","score":0.8469928503036499},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8344147801399231},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6915384531021118},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5891915559768677},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5567196607589722},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5564301609992981},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5246572494506836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.50364750623703},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4612058997154236},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4217374324798584},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.37898844480514526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35536932945251465},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.29200780391693115},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1518169641494751},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14777976274490356}],"concepts":[{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.8469928503036499},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8344147801399231},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6915384531021118},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5891915559768677},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5567196607589722},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5564301609992981},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5246572494506836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.50364750623703},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4612058997154236},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4217374324798584},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.37898844480514526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35536932945251465},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.29200780391693115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1518169641494751},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14777976274490356},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054114400115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400115","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":[{"score":0.7099999785423279,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1999147218","https://openalex.org/W2008342226","https://openalex.org/W2077450865","https://openalex.org/W2079577017","https://openalex.org/W2080108335","https://openalex.org/W2089236668","https://openalex.org/W2092860912","https://openalex.org/W2129414328"],"related_works":["https://openalex.org/W2030569822","https://openalex.org/W2050777932","https://openalex.org/W2772918710","https://openalex.org/W2079577017","https://openalex.org/W1851980922","https://openalex.org/W2488819432","https://openalex.org/W2136740376","https://openalex.org/W2037872771","https://openalex.org/W61785131","https://openalex.org/W3165010732"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,34,40,55,68,80,97],"descriptional":[3],"complexity":[4],"of":[5,12,70,82,99],"nondeterministic":[6,60,73,103],"biautomata,":[7],"which":[8],"are":[9,30,105],"a":[10],"generalization":[11],"biautomata":[13,29,48,74,104,108],"[O.":[14],"KL\u00cdMA,":[15],"L.":[16],"POL\u00c1K:":[17],"On":[18],"biautomata.":[19,61],"RAIRO":[20],"\u2014":[21],"Theor.":[22],"Inf.":[23],"Appl.,":[24],"46(4),":[25],"2012].":[26],"Simply":[27],"speaking,":[28],"finite":[31,84,101],"automata":[32,102],"reading":[33],"input":[35],"from":[36],"both":[37],"sides;":[38],"although":[39],"head":[41],"movement":[42],"is":[43],"nondeterministic,":[44],"additional":[45],"requirements":[46],"enforce":[47],"to":[49,79,107,111],"work":[50],"deterministically.":[51],"First":[52],"we":[53,63],"study":[54],"size":[56,81],"blow-up":[57],"when":[58],"determinizing":[59],"Further,":[62],"give":[64],"tight":[65],"bounds":[66],"on":[67],"number":[69],"states":[71],"for":[72],"accepting":[75],"regular":[76,86,117],"languages":[77],"relative":[78,113],"ordinary":[83,100],"automata,":[85],"expressions,":[87],"and":[88],"syntactic":[89],"monoids.":[90],"It":[91],"turns":[92],"out":[93],"that":[94],"as":[95],"in":[96,115],"case":[98],"superior":[106],"with":[109],"respect":[110],"their":[112],"succinctness":[114],"representing":[116],"languages.":[118]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}