{"id":"https://openalex.org/W1609763579","doi":"https://doi.org/10.1051/ita/2015004","title":"Linear grammars with one-sided contexts and their automaton representation","display_name":"Linear grammars with one-sided contexts and their automaton representation","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1609763579","doi":"https://doi.org/10.1051/ita/2015004","mag":"1609763579"},"language":"en","primary_location":{"id":"doi:10.1051/ita/2015004","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita/2015004","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"],"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":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ita/2015004.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043139647","display_name":"Mikhail Barash","orcid":"https://orcid.org/0000-0002-7067-2588"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mikhail Barash","raw_affiliation_strings":["Turku Centre for Computer Science, Turku 20014, Finland"],"affiliations":[{"raw_affiliation_string":"Turku Centre for Computer Science, Turku 20014, Finland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005683089","display_name":"Alexander Okhotin","orcid":"https://orcid.org/0000-0002-1615-2725"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Alexander Okhotin","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Turku, Turku 20014, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Turku, Turku 20014, Finland","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043139647"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4553,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.82349218,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"49","issue":"2","first_page":"153","last_page":"178"},"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/T12162","display_name":"Cellular Automata and Applications","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/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"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/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8984286785125732},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.8594247698783875},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.7792907953262329},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.7716711759567261},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.7515046000480652},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.7391446828842163},{"id":"https://openalex.org/keywords/phrase-structure-grammar","display_name":"Phrase structure grammar","score":0.7208374738693237},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.6701252460479736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5506526827812195},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.48487910628318787},{"id":"https://openalex.org/keywords/definite-clause-grammar","display_name":"Definite clause grammar","score":0.4702925682067871},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.3956437408924103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3841763436794281},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3669935464859009},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3283464312553406},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3252260088920593},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21098849177360535}],"concepts":[{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8984286785125732},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.8594247698783875},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.7792907953262329},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.7716711759567261},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.7515046000480652},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.7391446828842163},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.7208374738693237},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.6701252460479736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5506526827812195},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.48487910628318787},{"id":"https://openalex.org/C97169998","wikidata":"https://www.wikidata.org/wiki/Q1582738","display_name":"Definite clause grammar","level":5,"score":0.4702925682067871},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.3956437408924103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3841763436794281},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3669935464859009},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3283464312553406},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3252260088920593},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21098849177360535}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ita/2015004","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita/2015004","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"],"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_2015__49_2_153_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ita/2015004/","pdf_url":"https://www.numdam.org/item/10.1051/ita/2015004.pdf","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":{"id":"pmh:oai:numdam.org:ITA_2015__49_2_153_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ita/2015004/","pdf_url":"https://www.numdam.org/item/10.1051/ita/2015004.pdf","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"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.75,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1609763579.pdf","grobid_xml":"https://content.openalex.org/works/W1609763579.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W24640121","https://openalex.org/W122334062","https://openalex.org/W1806862383","https://openalex.org/W1971471851","https://openalex.org/W1984577612","https://openalex.org/W1989113687","https://openalex.org/W1994377305","https://openalex.org/W2019846069","https://openalex.org/W2041694802","https://openalex.org/W2046935329","https://openalex.org/W2073577522","https://openalex.org/W2085862166","https://openalex.org/W2115826265","https://openalex.org/W2117111784","https://openalex.org/W2117832390","https://openalex.org/W2154949534","https://openalex.org/W2161789621","https://openalex.org/W2180524208","https://openalex.org/W2185277039","https://openalex.org/W2212036697","https://openalex.org/W2256540913","https://openalex.org/W3145062246"],"related_works":["https://openalex.org/W2403874525","https://openalex.org/W2130892661","https://openalex.org/W2117111784","https://openalex.org/W2153803459","https://openalex.org/W1488942915","https://openalex.org/W2003615735","https://openalex.org/W2012632856","https://openalex.org/W24640121","https://openalex.org/W2792956200","https://openalex.org/W3130625959"],"abstract_inverted_index":{"The":[0,60,91],"paper":[1],"considers":[2],"a":[3,23,31,74,82,86],"family":[4],"of":[5,22,50,66,97],"formal":[6],"grammars":[7,12,40,71,103],"that":[8],"extends":[9],"linear":[10,36],"context-free":[11],"with":[13,30,55,89],"an":[14,48,56],"operator":[15],"for":[16,70,101],"referring":[17],"to":[18,43,47,73],"the":[19,64,67,95,98],"left":[20],"context":[21],"substring":[24],"being":[25],"defined,":[26],"as":[27,29],"well":[28],"conjunction":[32],"operation":[33],"(as":[34],"in":[35],"conjunctive":[37],"grammars).":[38],"These":[39],"are":[41],"proved":[42,79],"be":[44],"computationally":[45],"equivalent":[46],"extension":[49],"one-way":[51],"real-time":[52],"cellular":[53,87],"automata":[54],"extra":[57],"data":[58],"channel.":[59],"main":[61],"result":[62],"is":[63,78],"undecidability":[65],"emptiness":[68],"problem":[69,100],"restricted":[72],"one-symbol":[75],"alphabet,":[76],"which":[77],"by":[80,85],"simulating":[81],"Turing":[83],"machine":[84],"automaton":[88],"feedback.":[90],"same":[92],"construction":[93],"proves":[94],"\u03a302-completeness":[96],"finiteness":[99],"these":[102],"and":[104],"automata.":[105]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}