{"id":"https://openalex.org/W2551941547","doi":"https://doi.org/10.1142/s0129054116500246","title":"Operational State Complexity of Subtree-Free Regular Tree Languages","display_name":"Operational State Complexity of Subtree-Free Regular Tree Languages","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2551941547","doi":"https://doi.org/10.1142/s0129054116500246","mag":"2551941547"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054116500246","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116500246","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/A5011019318","display_name":"Sang\u2010Ki Ko","orcid":"https://orcid.org/0000-0002-5406-5104"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sang-Ki Ko","raw_affiliation_strings":["Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089986741","display_name":"Hae-Sung Eom","orcid":null},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hae-Sung Eom","raw_affiliation_strings":["Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077698683","display_name":"Yo-Sub Han","orcid":"https://orcid.org/0000-0002-7211-6657"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yo-Sub Han","raw_affiliation_strings":["Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, Republic of Korea","institution_ids":["https://openalex.org/I193775966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011019318"],"corresponding_institution_ids":["https://openalex.org/I193775966"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13409301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"06","first_page":"705","last_page":"724"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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.9954000115394592,"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.9950000047683716,"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/concatenation","display_name":"Concatenation (mathematics)","score":0.7320498824119568},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.7270867824554443},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6628522872924805},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6063361763954163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5914036631584167},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.576497495174408},{"id":"https://openalex.org/keywords/regular-tree-grammar","display_name":"Regular tree grammar","score":0.5710752606391907},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5157323479652405},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5095430016517639},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.4427727460861206},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.4356297552585602},{"id":"https://openalex.org/keywords/pumping-lemma-for-regular-languages","display_name":"Pumping lemma for regular languages","score":0.42049872875213623},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4091859757900238},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35937270522117615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32287806272506714},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26947933435440063},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.26157861948013306},{"id":"https://openalex.org/keywords/regular-grammar","display_name":"Regular grammar","score":0.12420359253883362},{"id":"https://openalex.org/keywords/second-generation-programming-language","display_name":"Second-generation programming language","score":0.0843382179737091},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06732657551765442}],"concepts":[{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.7320498824119568},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.7270867824554443},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6628522872924805},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6063361763954163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5914036631584167},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.576497495174408},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.5710752606391907},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5157323479652405},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5095430016517639},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.4427727460861206},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.4356297552585602},{"id":"https://openalex.org/C157968401","wikidata":"https://www.wikidata.org/wiki/Q2292874","display_name":"Pumping lemma for regular languages","level":5,"score":0.42049872875213623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4091859757900238},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35937270522117615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32287806272506714},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26947933435440063},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.26157861948013306},{"id":"https://openalex.org/C80191660","wikidata":"https://www.wikidata.org/wiki/Q645527","display_name":"Regular grammar","level":4,"score":0.12420359253883362},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.0843382179737091},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06732657551765442},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.0},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.0},{"id":"https://openalex.org/C69298649","wikidata":"https://www.wikidata.org/wiki/Q6045214","display_name":"Emergent grammar","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054116500246","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116500246","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":[{"id":"https://openalex.org/F4320321314","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W196919032","https://openalex.org/W198728890","https://openalex.org/W1482663448","https://openalex.org/W1525645762","https://openalex.org/W1546124752","https://openalex.org/W1593799327","https://openalex.org/W1974278282","https://openalex.org/W1988560957","https://openalex.org/W2006629323","https://openalex.org/W2015787121","https://openalex.org/W2040106564","https://openalex.org/W2054220885","https://openalex.org/W2054801208","https://openalex.org/W2063737596","https://openalex.org/W2068984365","https://openalex.org/W2070386554","https://openalex.org/W2074221742","https://openalex.org/W2084661883","https://openalex.org/W2088432971","https://openalex.org/W2098375093","https://openalex.org/W2105748890","https://openalex.org/W2108842989","https://openalex.org/W2109036808","https://openalex.org/W2116509046","https://openalex.org/W2141385438","https://openalex.org/W2166846151","https://openalex.org/W2178095809","https://openalex.org/W2405518592","https://openalex.org/W2731404489","https://openalex.org/W2911295106"],"related_works":["https://openalex.org/W2969647416","https://openalex.org/W2949264404","https://openalex.org/W2287653152","https://openalex.org/W4384942687","https://openalex.org/W4385762577","https://openalex.org/W2005581205","https://openalex.org/W2387420755","https://openalex.org/W1996651813","https://openalex.org/W1540583425","https://openalex.org/W4376863261"],"abstract_inverted_index":{"We":[0,65],"introduce":[1],"subtree-free":[2,22,82],"regular":[3,23,33,83],"tree":[4,24,34,54,59,84],"languages":[5,35],"that":[6,41,56],"are":[7,42],"closely":[8],"related":[9],"to":[10],"XML":[11],"schemas":[12],"and":[13,44,79],"investigate":[14],"the":[15,37,47,50,58,63,67],"state":[16,27,69],"complexity":[17,28,70],"of":[18,29,39,71],"basic":[19],"operations":[20],"on":[21],"languages.":[25,85],"The":[26],"an":[30],"operation":[31],"for":[32,49,81],"is":[36],"number":[38],"states":[40],"sufficient":[43],"necessary":[45],"in":[46],"worst-case":[48],"minimal":[51],"deterministic":[52],"ranked":[53],"automaton":[55],"accepts":[57],"language":[60],"obtained":[61],"from":[62],"operation.":[64],"establish":[66],"precise":[68],"(sequential,":[72],"parallel)":[73],"concatenation,":[74],"(bottom-up,":[75],"top-down)":[76],"star,":[77],"intersection":[78],"union":[80]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}