{"id":"https://openalex.org/W1972680079","doi":"https://doi.org/10.1142/s0129054107004930","title":"REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE","display_name":"REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE","publication_year":2007,"publication_date":"2007-07-30","ids":{"openalex":"https://openalex.org/W1972680079","doi":"https://doi.org/10.1142/s0129054107004930","mag":"1972680079"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054107004930","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054107004930","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/A5074596802","display_name":"C\u00e9dric Bastien","orcid":null},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"C\u00c9DRIC BASTIEN","raw_affiliation_strings":["D\u00e9pt d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau PQ, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9pt d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau PQ, Canada","institution_ids":["https://openalex.org/I33217400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067736776","display_name":"Jurek Czyzowicz","orcid":"https://orcid.org/0000-0002-9026-1217"},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"JUREK CZYZOWICZ","raw_affiliation_strings":["D\u00e9pt d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau PQ, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9pt d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau PQ, Canada","institution_ids":["https://openalex.org/I33217400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010418151","display_name":"Wojciech Fr\u0105czak","orcid":null},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"WOJCIECH FRACZAK","raw_affiliation_strings":["D\u00e9pt d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau PQ, Canada","IDT Canada Inc., Ottawa ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9pt d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau PQ, Canada","institution_ids":["https://openalex.org/I33217400"]},{"raw_affiliation_string":"IDT Canada Inc., Ottawa ON, Canada","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079957387","display_name":"Wojciech Rytter","orcid":"https://orcid.org/0000-0002-9162-6724"},"institutions":[{"id":"https://openalex.org/I3019271933","display_name":"Nicolaus Copernicus University","ror":"https://ror.org/0102mm775","country_code":"PL","type":"education","lineage":["https://openalex.org/I3019271933"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"WOJCIECH RYTTER","raw_affiliation_strings":["Department of Mathematics and Informatics, Copernicus University, Torun, Poland","Instytut Informatyki, Universytet Warszawski, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Informatics, Copernicus University, Torun, Poland","institution_ids":["https://openalex.org/I3019271933"]},{"raw_affiliation_string":"Instytut Informatyki, Universytet Warszawski, Warsaw, Poland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5074596802"],"corresponding_institution_ids":["https://openalex.org/I33217400"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0706205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"04","first_page":"715","last_page":"725"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.7570091485977173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.709111213684082},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6552562713623047},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5994681715965271},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5958322286605835},{"id":"https://openalex.org/keywords/stateless-protocol","display_name":"Stateless protocol","score":0.5657418370246887},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.5038380026817322},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5027663707733154},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49340835213661194},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.493299663066864},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.4406700134277344},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4178617596626282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3576205372810364},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.3188467025756836},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.302382230758667},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.2811931371688843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2341698706150055},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.19586116075515747},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19081735610961914},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14750313758850098}],"concepts":[{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.7570091485977173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.709111213684082},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6552562713623047},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5994681715965271},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5958322286605835},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.5657418370246887},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.5038380026817322},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5027663707733154},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49340835213661194},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.493299663066864},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.4406700134277344},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4178617596626282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3576205372810364},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.3188467025756836},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.302382230758667},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2811931371688843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2341698706150055},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.19586116075515747},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19081735610961914},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14750313758850098},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054107004930","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054107004930","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1512065894","https://openalex.org/W2051521505","https://openalex.org/W2276792833"],"related_works":["https://openalex.org/W191660820","https://openalex.org/W4291134532","https://openalex.org/W166967587","https://openalex.org/W2019032507","https://openalex.org/W151331935","https://openalex.org/W2364393301","https://openalex.org/W2084935533","https://openalex.org/W1609763579","https://openalex.org/W4294576161","https://openalex.org/W207821149"],"abstract_inverted_index":{"Simple":[0],"grammar":[1,39],"reduction":[2],"is":[3,68,86],"an":[4],"important":[5],"component":[6],"in":[7,71,93],"the":[8,35,65,72,83,94,107],"implementation":[9],"of":[10,17,34,96],"Concatenation":[11],"State":[12],"Machines":[13],"(a":[14],"hardware":[15],"version":[16],"stateless":[18],"push-down":[19],"automata":[20],"designed":[21],"for":[22,38,105],"wire-speed":[23],"network":[24,97],"packet":[25,98],"classification).":[26],"We":[27],"present":[28],"a":[29],"comparison":[30],"and":[31,54],"experimental":[32],"analysis":[33],"best-known":[36],"algorithms":[37],"reduction.":[40],"There":[41],"are":[42,103],"two":[43],"approaches":[44],"to":[45],"this":[46],"problem:":[47],"one":[48,56,85],"processing":[49],"compressed":[50],"strings":[51,59],"without":[52],"decompression":[53],"another":[55],"which":[57],"processes":[58],"explicitly.":[60],"It":[61],"turns":[62],"out":[63],"that":[64],"second":[66],"approach":[67],"more":[69],"efficient":[70],"considered":[73],"practical":[74],"scenario":[75],"despite":[76],"having":[77],"worst-case":[78],"exponential":[79],"time":[80],"complexity":[81],"(while":[82],"first":[84],"polynomial).":[87],"The":[88],"study":[89],"has":[90],"been":[91],"conducted":[92],"context":[95],"classification,":[99],"where":[100],"simple":[101],"grammars":[102],"used":[104],"representing":[106],"classification":[108],"policies.":[109]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}