{"id":"https://openalex.org/W1486955936","doi":"https://doi.org/10.1007/978-3-642-18381-2_36","title":"Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages","display_name":"Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1486955936","doi":"https://doi.org/10.1007/978-3-642-18381-2_36","mag":"1486955936"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-18381-2_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-18381-2_36","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/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"]},{"id":"https://openalex.org/I112281704","display_name":"Research Council of Finland","ror":"https://ror.org/05k73zm37","country_code":"FI","type":"government","lineage":["https://openalex.org/I112281704"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Alexander Okhotin","raw_affiliation_strings":["Department of Mathematics, University of Turku, Academy of Finland, Turku, Finland","Department of Mathematics, University of Turku, Academy of Finland, Turku, Finland#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Turku, Academy of Finland, Turku, Finland","institution_ids":["https://openalex.org/I112281704","https://openalex.org/I155660961"]},{"raw_affiliation_string":"Department of Mathematics, University of Turku, Academy of Finland, Turku, Finland#TAB#","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005683089"],"corresponding_institution_ids":["https://openalex.org/I112281704","https://openalex.org/I155660961"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.7239,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.89607843,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"431","last_page":"443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9995999932289124,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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.9986000061035156,"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/context-free-language","display_name":"Context-free language","score":0.8664496541023254},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8464231491088867},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7989006042480469},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.780885636806488},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6799358129501343},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5815094113349915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5443068146705627},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.46012023091316223},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4280732274055481},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42586636543273926},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40146276354789734},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.38981759548187256},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3773903250694275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3738400936126709},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3663421869277954},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3618581295013428},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.21634861826896667},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.15253034234046936},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1412886083126068},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.10947757959365845},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.10132193565368652},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.07236891984939575}],"concepts":[{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.8664496541023254},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8464231491088867},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7989006042480469},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.780885636806488},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6799358129501343},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5815094113349915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5443068146705627},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.46012023091316223},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4280732274055481},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42586636543273926},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40146276354789734},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.38981759548187256},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3773903250694275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3738400936126709},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3663421869277954},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3618581295013428},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.21634861826896667},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.15253034234046936},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1412886083126068},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.10947757959365845},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.10132193565368652},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.07236891984939575},{"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.1007/978-3-642-18381-2_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-18381-2_36","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1500579221","https://openalex.org/W1556758361","https://openalex.org/W1583560904","https://openalex.org/W1590044367","https://openalex.org/W1971471851","https://openalex.org/W1983278039","https://openalex.org/W1989113687","https://openalex.org/W1990727398","https://openalex.org/W1992115994","https://openalex.org/W1997037354","https://openalex.org/W2039297197","https://openalex.org/W2041694802","https://openalex.org/W2046935329","https://openalex.org/W2072827730","https://openalex.org/W2085862166","https://openalex.org/W2115826265","https://openalex.org/W2151033407","https://openalex.org/W2154949534","https://openalex.org/W2185277039","https://openalex.org/W2294348221","https://openalex.org/W2479946866","https://openalex.org/W2912251669","https://openalex.org/W2962855110","https://openalex.org/W3145062246"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W127918926","https://openalex.org/W2089141720","https://openalex.org/W214992615","https://openalex.org/W1972232894","https://openalex.org/W2068249429","https://openalex.org/W4206600150","https://openalex.org/W2400175085"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}