{"id":"https://openalex.org/W4312828186","doi":"https://doi.org/10.1007/978-3-031-17715-6_27","title":"Formal Grammars for\u00a0Turn-Bounded Deterministic Context-Free Languages","display_name":"Formal Grammars for\u00a0Turn-Bounded Deterministic Context-Free Languages","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4312828186","doi":"https://doi.org/10.1007/978-3-031-17715-6_27"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-17715-6_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-17715-6_27","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/A5085555714","display_name":"Tomoyuki Yamakami","orcid":"https://orcid.org/0009-0002-4842-4841"},"institutions":[{"id":"https://openalex.org/I111966504","display_name":"University of Fukui","ror":"https://ror.org/00msqp585","country_code":"JP","type":"education","lineage":["https://openalex.org/I111966504"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tomoyuki Yamakami","raw_affiliation_strings":["Faculty of Engineering, University of Fukui, 3-9-1, Bunkyo, Fukui, 910-8507, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, University of Fukui, 3-9-1, Bunkyo, Fukui, 910-8507, Japan","institution_ids":["https://openalex.org/I111966504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085555714"],"corresponding_institution_ids":["https://openalex.org/I111966504"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6638,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.75517011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"425","last_page":"441"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9914000034332275,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7445923089981079},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.7056956887245178},{"id":"https://openalex.org/keywords/pumping-lemma-for-regular-languages","display_name":"Pumping lemma for regular languages","score":0.6859416365623474},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6852984428405762},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6659892797470093},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6642187833786011},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6526916027069092},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5379190444946289},{"id":"https://openalex.org/keywords/abstract-family-of-languages","display_name":"Abstract family of languages","score":0.4975915253162384},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.45291587710380554},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.45066630840301514},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.4399332106113434},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.43756672739982605},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.43160784244537354},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.41302186250686646},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.41296127438545227},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.3962940275669098},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.3886699080467224},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.35651665925979614},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33750373125076294},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16531407833099365},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.15322557091712952},{"id":"https://openalex.org/keywords/second-generation-programming-language","display_name":"Second-generation programming language","score":0.15234056115150452},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.09154769778251648},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.06819969415664673}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7445923089981079},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.7056956887245178},{"id":"https://openalex.org/C157968401","wikidata":"https://www.wikidata.org/wiki/Q2292874","display_name":"Pumping lemma for regular languages","level":5,"score":0.6859416365623474},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6852984428405762},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6659892797470093},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6642187833786011},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6526916027069092},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5379190444946289},{"id":"https://openalex.org/C199163288","wikidata":"https://www.wikidata.org/wiki/Q3065587","display_name":"Abstract family of languages","level":5,"score":0.4975915253162384},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.45291587710380554},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.45066630840301514},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.4399332106113434},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.43756672739982605},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.43160784244537354},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.41302186250686646},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.41296127438545227},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.3962940275669098},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3886699080467224},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.35651665925979614},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33750373125076294},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16531407833099365},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.15322557091712952},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.15234056115150452},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.09154769778251648},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.06819969415664673},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-17715-6_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-17715-6_27","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1505482284","https://openalex.org/W1968529600","https://openalex.org/W2009481224","https://openalex.org/W2020570874","https://openalex.org/W2024987067","https://openalex.org/W2037800309","https://openalex.org/W2043456730","https://openalex.org/W2058929902","https://openalex.org/W2063554457","https://openalex.org/W2064490449","https://openalex.org/W2066725205","https://openalex.org/W2092008211","https://openalex.org/W2107166068","https://openalex.org/W2120105239","https://openalex.org/W2911116314","https://openalex.org/W2962898883","https://openalex.org/W3006766709","https://openalex.org/W4225755196"],"related_works":["https://openalex.org/W1543969654","https://openalex.org/W2068249429","https://openalex.org/W1992439855","https://openalex.org/W2022934640","https://openalex.org/W276006532","https://openalex.org/W4312828186","https://openalex.org/W577002723","https://openalex.org/W2012906089","https://openalex.org/W2083245182","https://openalex.org/W1990893893"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}