{"id":"https://openalex.org/W2058194693","doi":"https://doi.org/10.1142/s0129054113500068","title":"A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA","display_name":"A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2058194693","doi":"https://doi.org/10.1142/s0129054113500068","mag":"2058194693"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500068","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500068","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/A5006279709","display_name":"Tom\u00e1\u0161 Masopust","orcid":"https://orcid.org/0000-0001-9282-758X"},"institutions":[{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"TOM\u00c1\u0160 MASOPUST","raw_affiliation_strings":["Institute of Mathematics, Academy of Sciences of the Czech Republic, \u017di\u017ekova 22, 616 62 Brno, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Academy of Sciences of the Czech Republic, \u017di\u017ekova 22, 616 62 Brno, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006279709"],"corresponding_institution_ids":["https://openalex.org/I4210120266"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10507779,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"03","first_page":"319","last_page":"328"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9998999834060669,"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.9955000281333923,"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/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8460896611213684},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.8416661024093628},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.775628924369812},{"id":"https://openalex.org/keywords/stateless-protocol","display_name":"Stateless protocol","score":0.6897594332695007},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6622243523597717},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5413427948951721},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5178042650222778},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4846082627773285},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.483275443315506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4286143183708191},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4256824254989624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37220609188079834},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.3641144633293152},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.34841668605804443},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32494479417800903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23227596282958984},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.22670391201972961},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.17394813895225525},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.1557227075099945},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1496184766292572},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.08171528577804565},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.08057284355163574}],"concepts":[{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8460896611213684},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8416661024093628},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.775628924369812},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.6897594332695007},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6622243523597717},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5413427948951721},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5178042650222778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4846082627773285},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.483275443315506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4286143183708191},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4256824254989624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37220609188079834},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3641144633293152},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.34841668605804443},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32494479417800903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23227596282958984},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.22670391201972961},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.17394813895225525},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.1557227075099945},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1496184766292572},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.08171528577804565},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.08057284355163574},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129054113500068","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500068","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.753.3369","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.753.3369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1208.5002.pdf","raw_type":"text"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0394000","is_oa":false,"landing_page_url":"http://hdl.handle.net/11104/0222328","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W79539576","https://openalex.org/W166967587","https://openalex.org/W209349615","https://openalex.org/W359905323","https://openalex.org/W1535681052","https://openalex.org/W1548607128","https://openalex.org/W1562818191","https://openalex.org/W1573425533","https://openalex.org/W1817451992","https://openalex.org/W1877225925","https://openalex.org/W2003477691","https://openalex.org/W2012313512","https://openalex.org/W2035842346","https://openalex.org/W2056734538","https://openalex.org/W2078050093","https://openalex.org/W2111753126","https://openalex.org/W2125690314","https://openalex.org/W2165544449","https://openalex.org/W2201560690","https://openalex.org/W2491913928","https://openalex.org/W2545845195","https://openalex.org/W2914032487"],"related_works":["https://openalex.org/W392685101","https://openalex.org/W1972232894","https://openalex.org/W1991406344","https://openalex.org/W2067895928","https://openalex.org/W2171067235","https://openalex.org/W2012479020","https://openalex.org/W2472752294","https://openalex.org/W127918926","https://openalex.org/W1486486721","https://openalex.org/W4241567000"],"abstract_inverted_index":{"Recently,":[0],"an":[1,35],"infinite":[2],"hierarchy":[3,32,99],"of":[4,19,30,65,96],"languages":[5],"accepted":[6],"by":[7,50,74],"stateless":[8],"deterministic":[9,86,102],"pushdown":[10,20,87,103],"automata":[11,104],"has":[12],"been":[13],"established":[14],"based":[15],"on":[16],"the":[17,23,27,31,70],"number":[18],"symbols.":[21],"However,":[22],"witness":[24],"language":[25],"for":[26,89,100],"nth":[28],"level":[29],"is":[33,56,105],"over":[34],"input":[36],"alphabet":[37,55],"with":[38],"2(n":[39],"\u2212":[40],"1)":[41],"elements.":[42],"In":[43],"this":[44,48,60],"paper,":[45],"we":[46,68,79],"improve":[47],"result":[49],"showing":[51],"that":[52],"a":[53,63,98],"binary":[54],"sufficient":[57],"to":[58,83],"establish":[59],"hierarchy.":[61],"As":[62],"consequence":[64],"our":[66],"construction,":[67],"solve":[69],"open":[71],"problem":[72],"formulated":[73],"Meduna":[75],"et":[76],"al.":[77],"Then":[78],"extend":[80],"these":[81],"results":[82],"m-state":[84,101],"realtime":[85],"automata,":[88],"all":[90],"m":[91],"\u2265":[92],"1.":[93],"The":[94],"existence":[95],"such":[97],"left":[106],"open.":[107]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}