{"id":"https://openalex.org/W2215050074","doi":"https://doi.org/10.1145/2818936.2818947","title":"Guest Column","display_name":"Guest Column","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2215050074","doi":"https://doi.org/10.1145/2818936.2818947","mag":"2215050074"},"language":"en","primary_location":{"id":"doi:10.1145/2818936.2818947","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2818936.2818947","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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/A5029400752","display_name":"Giovanni Pighizzini","orcid":"https://orcid.org/0000-0002-7509-7842"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giovanni Pighizzini","raw_affiliation_strings":["Universit\u00e0 degli Studi di Milano, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029400752"],"corresponding_institution_ids":["https://openalex.org/I189158943"],"apc_list":null,"apc_paid":null,"fwci":0.3723,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66569946,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"46","issue":"3","first_page":"37","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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.9991999864578247,"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/T12029","display_name":"DNA and Biological Computing","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7989521026611328},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6854631900787354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6634730696678162},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.6161512136459351},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6007946729660034},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.5243126153945923},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5112698078155518},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5094566941261292},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4685189425945282},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4476456344127655},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4475395083427429},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4349675178527832},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.41579484939575195},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38471710681915283},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.2803386449813843},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.27093321084976196},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22735658288002014},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.16460981965065002},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.11820083856582642},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10340195894241333},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.07574036717414856},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.07329165935516357}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7989521026611328},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6854631900787354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6634730696678162},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.6161512136459351},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6007946729660034},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.5243126153945923},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5112698078155518},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5094566941261292},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4685189425945282},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4476456344127655},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4475395083427429},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4349675178527832},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.41579484939575195},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38471710681915283},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2803386449813843},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.27093321084976196},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22735658288002014},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.16460981965065002},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.11820083856582642},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10340195894241333},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.07574036717414856},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.07329165935516357},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2818936.2818947","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2818936.2818947","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W107365663","https://openalex.org/W137331784","https://openalex.org/W1069688093","https://openalex.org/W1496964377","https://openalex.org/W1498193456","https://openalex.org/W1528597009","https://openalex.org/W1546460626","https://openalex.org/W1547855826","https://openalex.org/W1890888469","https://openalex.org/W1978405212","https://openalex.org/W1981296138","https://openalex.org/W1982374894","https://openalex.org/W1984391920","https://openalex.org/W2000118875","https://openalex.org/W2015023413","https://openalex.org/W2029872977","https://openalex.org/W2033229895","https://openalex.org/W2046523441","https://openalex.org/W2059646261","https://openalex.org/W2072964679","https://openalex.org/W2087008115","https://openalex.org/W2089690927","https://openalex.org/W2091836802","https://openalex.org/W2113967778","https://openalex.org/W2168431435","https://openalex.org/W2169203237","https://openalex.org/W2532500577","https://openalex.org/W2533977282","https://openalex.org/W2561675875"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2089141720","https://openalex.org/W2400175085","https://openalex.org/W1914352394","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W2047588061","https://openalex.org/W2950941115","https://openalex.org/W2023439061","https://openalex.org/W4379744627"],"abstract_inverted_index":{"We":[0],"present":[1],"two":[2],"restricted":[3],"versions":[4],"of":[5,13,97],"one-tape":[6],"Turing":[7],"machines.":[8],"Both":[9],"characterize":[10,65,83],"the":[11,17,38,71,87,94],"class":[12],"context-free":[14,67,84,105],"languages.":[15,68,85],"In":[16,100],"first":[18,39],"version,":[19],"proposed":[20],"by":[21,111],"Hibbard":[22],"in":[23,37],"1967":[24],"and":[25],"called":[26],"limited":[27,55,77,98,115],"automata":[28,56,78],",":[29],"each":[30],"tape":[31],"cell":[32],"can":[33],"be":[34],"rewritten":[35],"only":[36],"d":[40,46,51],"visits,":[41],"for":[42,50],"a":[43],"fixed":[44],"constant":[45],"\u2265":[47],"2.":[48],"Furthermore,":[49],"=":[52],"2":[53],"deterministic":[54,60,66,88,95,104,113],"are":[57,108],"equivalent":[58],"to":[59],"pushdown":[61],"automata,":[62],"namely":[63],"they":[64],"Further":[69],"restricting":[70],"possible":[72],"operations,":[73],"we":[74],"consider":[75],"strongly":[76,114],".":[79],"These":[80],"models":[81],"still":[82],"However,":[86],"version":[89,96],"is":[90],"less":[91],"powerful":[92],"than":[93],"automata.":[99],"fact,":[101],"there":[102],"exist":[103],"languages":[106],"that":[107],"not":[109],"accepted":[110],"any":[112],"automaton.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}