{"id":"https://openalex.org/W2973381442","doi":"https://doi.org/10.1142/s0129054119400367","title":"State Complexity of the Quotient Operation on Input-Driven Pushdown Automata","display_name":"State Complexity of the Quotient Operation on Input-Driven Pushdown Automata","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2973381442","doi":"https://doi.org/10.1142/s0129054119400367","mag":"2973381442"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054119400367","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119400367","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/A5005683089","display_name":"Alexander Okhotin","orcid":"https://orcid.org/0000-0002-1615-2725"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander Okhotin","raw_affiliation_strings":["St. Petersburg State University, 7/9 Universitetskaya nab., Saint Petersburg 199034, Russia"],"affiliations":[{"raw_affiliation_string":"St. Petersburg State University, 7/9 Universitetskaya nab., Saint Petersburg 199034, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009151151","display_name":"Kai Salomaa","orcid":"https://orcid.org/0000-0003-4582-7477"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kai Salomaa","raw_affiliation_strings":["School of Computing, Queen\u2019s University, Kingston, Ontario K7L 2N8, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u2019s University, Kingston, Ontario K7L 2N8, Canada","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005683089"],"corresponding_institution_ids":["https://openalex.org/I172901346"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14666154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"06n07","first_page":"1217","last_page":"1235"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"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.9972000122070312,"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/pushdown-automaton","display_name":"Pushdown automaton","score":0.7281568646430969},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7136508822441101},{"id":"https://openalex.org/keywords/quotient","display_name":"Quotient","score":0.6520053744316101},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5720252990722656},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5369152426719666},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5091976523399353},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4897887706756592},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.45823317766189575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4525345265865326},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.43302708864212036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4011884927749634},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.39733925461769104},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.35435014963150024},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3513930141925812},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.33995258808135986},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.30838119983673096},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.29981303215026855},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.15064460039138794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14812850952148438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14529269933700562},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07057899236679077}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7281568646430969},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7136508822441101},{"id":"https://openalex.org/C199422724","wikidata":"https://www.wikidata.org/wiki/Q41118","display_name":"Quotient","level":2,"score":0.6520053744316101},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5720252990722656},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5369152426719666},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5091976523399353},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4897887706756592},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.45823317766189575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4525345265865326},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.43302708864212036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4011884927749634},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.39733925461769104},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.35435014963150024},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3513930141925812},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.33995258808135986},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.30838119983673096},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.29981303215026855},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.15064460039138794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14812850952148438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14529269933700562},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07057899236679077},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054119400367","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119400367","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":18,"referenced_works":["https://openalex.org/W31912597","https://openalex.org/W1568921927","https://openalex.org/W1988292889","https://openalex.org/W1996644214","https://openalex.org/W2008342226","https://openalex.org/W2020570874","https://openalex.org/W2032759707","https://openalex.org/W2054279067","https://openalex.org/W2061265323","https://openalex.org/W2079567772","https://openalex.org/W2131886132","https://openalex.org/W2151033407","https://openalex.org/W2160491455","https://openalex.org/W2188317464","https://openalex.org/W2585141159","https://openalex.org/W2611419246","https://openalex.org/W2620675909","https://openalex.org/W4256581173"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W2089141720","https://openalex.org/W1602383402","https://openalex.org/W1486486721","https://openalex.org/W2116448069","https://openalex.org/W2122981347","https://openalex.org/W2047588061","https://openalex.org/W2950941115","https://openalex.org/W1804899877"],"abstract_inverted_index":{"The":[0,46],"quotient":[1,47,80,106],"of":[2,18,35,48,64,87,90,110,115,148],"a":[3,24,33,36,49],"formal":[4],"language":[5,11,51,54],"[Formula:":[6,12,27,39,134,138,142,154,158],"see":[7,13,28,40,135,139,143,155,159],"text]":[8,14,29,140,144,156],"by":[9,22,52,93],"another":[10],"is":[15,55,118,129],"the":[16,59,69,72,79,85,88,105,113,116,146,151],"set":[17],"all":[19],"strings":[20],"obtained":[21],"taking":[23],"string":[25,37],"from":[26,38],"that":[30,44],"ends":[31],"with":[32,124],"suffix":[34],"text],":[41,136,160],"and":[42,62,71,120,141,157],"removing":[43],"suffix.":[45],"regular":[50],"any":[53],"always":[56],"regular,":[57],"whereas":[58],"context-free":[60],"languages":[61,91],"many":[63],"their":[65],"subfamilies,":[66],"such":[67],"as":[68,100],"linear":[70],"deterministic":[73],"languages,":[74],"are":[75,145],"not":[76],"closed":[77],"under":[78,104],"operation.":[81,107],"This":[82],"paper":[83],"establishes":[84],"closure":[86],"family":[89],"recognized":[92],"input-driven":[94],"pushdown":[95,102],"automata":[96,111,152],"(IDPDA),":[97],"also":[98],"known":[99],"visibly":[101],"automata,":[103],"A":[108],"construction":[109],"representing":[112],"result":[114],"operation":[117],"given,":[119],"its":[121],"state":[122],"complexity":[123],"respect":[125],"to":[126,131],"nondeterministic":[127],"IDPDA":[128],"shown":[130],"be":[132],"exactly":[133],"where":[137],"numbers":[147],"states":[149],"in":[150],"recognizing":[153],"respectively.":[161]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}