{"id":"https://openalex.org/W1980155685","doi":"https://doi.org/10.1051/ita:2005024","title":"Complexity results for prefix grammars","display_name":"Complexity results for prefix grammars","publication_year":2005,"publication_date":"2005-04-01","ids":{"openalex":"https://openalex.org/W1980155685","doi":"https://doi.org/10.1051/ita:2005024","mag":"1980155685"},"language":"en","primary_location":{"id":"doi:10.1051/ita:2005024","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2005024","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","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/A5005500210","display_name":"Markus Lohrey","orcid":"https://orcid.org/0000-0002-4680-7198"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Lohrey","raw_affiliation_strings":["University of Stuttgart, FMI, Universit\u00e4tsstr. 38, 70569 Stuttgart, Germany; lohrey@informatik.uni-stuttgart.de; petersen@informatik.uni-stuttgart.de","University of Stuttgart, FMI, Universit\u00e4tsstr. 38, 70569 Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stuttgart, FMI, Universit\u00e4tsstr. 38, 70569 Stuttgart, Germany; lohrey@informatik.uni-stuttgart.de; petersen@informatik.uni-stuttgart.de","institution_ids":["https://openalex.org/I100066346"]},{"raw_affiliation_string":"University of Stuttgart, FMI, Universit\u00e4tsstr. 38, 70569 Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112642829","display_name":"Holger Petersen","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Holger Petersen","raw_affiliation_strings":["University of Stuttgart, FMI, Universit\u00e4tsstr. 38, 70569 Stuttgart, Germany; lohrey@informatik.uni-stuttgart.de; petersen@informatik.uni-stuttgart.de","University of Stuttgart, FMI, Universit\u00e4tsstr. 38, 70569 Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stuttgart, FMI, Universit\u00e4tsstr. 38, 70569 Stuttgart, Germany; lohrey@informatik.uni-stuttgart.de; petersen@informatik.uni-stuttgart.de","institution_ids":["https://openalex.org/I100066346"]},{"raw_affiliation_string":"University of Stuttgart, FMI, Universit\u00e4tsstr. 38, 70569 Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10536352,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":"2","first_page":"391","last_page":"401"},"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/T10181","display_name":"Natural Language Processing Techniques","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"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9944999814033508,"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/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.7868213653564453},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.7519396543502808},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.7192915678024292},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.7167360782623291},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6264991760253906},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5976184010505676},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5742735266685486},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5096044540405273},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.4827960729598999},{"id":"https://openalex.org/keywords/phrase-structure-grammar","display_name":"Phrase structure grammar","score":0.4693867862224579},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45300590991973877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4526989758014679},{"id":"https://openalex.org/keywords/definite-clause-grammar","display_name":"Definite clause grammar","score":0.44759657979011536},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.4427294433116913},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.4315032362937927},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4047693610191345},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3876575231552124},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2701437175273895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2204689383506775},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18650376796722412},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.10487884283065796}],"concepts":[{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.7868213653564453},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.7519396543502808},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.7192915678024292},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.7167360782623291},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6264991760253906},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5976184010505676},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5742735266685486},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5096044540405273},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.4827960729598999},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.4693867862224579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45300590991973877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4526989758014679},{"id":"https://openalex.org/C97169998","wikidata":"https://www.wikidata.org/wiki/Q1582738","display_name":"Definite clause grammar","level":5,"score":0.44759657979011536},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.4427294433116913},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.4315032362937927},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4047693610191345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3876575231552124},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2701437175273895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2204689383506775},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18650376796722412},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.10487884283065796},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ita:2005024","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2005024","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:ITA_2005__39_2_391_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ita:2005024/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W200063938","https://openalex.org/W1491036809","https://openalex.org/W1971842919","https://openalex.org/W1992761098","https://openalex.org/W1998084650","https://openalex.org/W1999647826","https://openalex.org/W2003192754","https://openalex.org/W2007464118","https://openalex.org/W2035561341","https://openalex.org/W2075328216","https://openalex.org/W2114132089","https://openalex.org/W2132295002","https://openalex.org/W2258595992","https://openalex.org/W4210905115","https://openalex.org/W4232505977","https://openalex.org/W4241108585"],"related_works":["https://openalex.org/W2403874525","https://openalex.org/W2067980891","https://openalex.org/W1557335907","https://openalex.org/W2153803459","https://openalex.org/W2098975473","https://openalex.org/W59084530","https://openalex.org/W1608157979","https://openalex.org/W1970209336","https://openalex.org/W1488942915","https://openalex.org/W1980155685"],"abstract_inverted_index":{"Resolving":[0],"an":[1],"open":[2],"problem":[3,36],"of":[4,12,44],"Ravikumar":[5],"and":[6,40,46,64],"Quan,":[7],"we":[8,56],"show":[9,21,57],"that":[10,22,34,58],"equivalence":[11,45],"prefix":[13],"grammars":[14,26,52],"is":[15,27,37,60],"complete":[16,28,61],"in":[17,29,38,62],"PSPACE.":[18],"We":[19],"also":[20],"membership":[23,59],"for":[24,48,66,68],"these":[25],"P":[30],"(it":[31],"was":[32],"known":[33],"this":[35],"P)":[39],"characterize":[41],"the":[42],"complexity":[43],"inclusion":[47],"monotonic":[49,69],"grammars.":[50,70],"For":[51],"with":[53],"several":[54],"premises":[55],"EXPTIME":[63],"hard":[65],"PSPACE":[67]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}