{"id":"https://openalex.org/W2404248877","doi":"https://doi.org/10.25596/jalc-2014-119","title":"Weak Synchronization and Synchronizability of Multi-Tape Pushdown Automata and Turing Machines","display_name":"Weak Synchronization and Synchronizability of Multi-Tape Pushdown Automata and Turing Machines","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2404248877","doi":"https://doi.org/10.25596/jalc-2014-119","mag":"2404248877"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2014-119","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2014-119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.25596/jalc-2014-119","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110211208","display_name":"\u00d3scar H. Ibarra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ibarra, Oscar H.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110237721","display_name":"Nicholas Tr\u00e2n","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tran, Nicholas Q.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3491,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67799984,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"19","issue":null,"first_page":"119","last_page":"132"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9993000030517578,"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.9993000030517578,"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.9969000220298767,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9901999831199646,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.8035356402397156},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6499425768852234},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6429188847541809},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.612352192401886},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.4272875189781189},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3912092447280884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33117741346359253},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23290511965751648},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20213943719863892},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.13350236415863037},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.06838208436965942}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8035356402397156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6499425768852234},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6429188847541809},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.612352192401886},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.4272875189781189},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3912092447280884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33117741346359253},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23290511965751648},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20213943719863892},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.13350236415863037},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.06838208436965942},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0},{"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/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.25596/jalc-2014-119","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2014-119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2404248877","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc19.html#IbarraT14","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of automata, languages and combinatorics","raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2014-119","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2014-119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W100600401","https://openalex.org/W1994385456","https://openalex.org/W1603445208","https://openalex.org/W3035685209","https://openalex.org/W2044199853","https://openalex.org/W1802937628","https://openalex.org/W2085524178","https://openalex.org/W1930049440","https://openalex.org/W2032759707","https://openalex.org/W2997132552","https://openalex.org/W1869556578","https://openalex.org/W2034260782","https://openalex.org/W1980831096","https://openalex.org/W2064514470","https://openalex.org/W1491290840","https://openalex.org/W1972197524","https://openalex.org/W2917263446","https://openalex.org/W1971842919","https://openalex.org/W1804522637","https://openalex.org/W2073767883"],"abstract_inverted_index":{"Given":[0,123,141],"an":[1,16,46,90,113,124,142],"$n$-tape":[2,125,143],"automaton":[3,126,144,157],"$M$":[4,28,100,145],"with":[5],"a":[6,21,78,133,154],"one-way":[7],"read-only":[8],"head":[9,79],"per":[10],"tape":[11,68],"which":[12,60],"is":[13,29,42,45,61,97,128],"delimited":[14],"by":[15],"end":[17],"marker":[18],"$\\$$":[19,111],"and":[20,139,146,193,208],"nonnegative":[22],"integer":[23],"$k$,":[24],"we":[25,167,181,200],"say":[26],"that":[27,41,52,160,199],"weakly":[30,130,155],"$k$-synchronized":[31,131,156],"if":[32,99],"for":[33,132],"every":[34],"$n$-tuple":[35,91],"$x":[36,92],"=":[37,93,162],"(x_1,":[38,94],"\\dots,":[39],"x_n)$":[40,96],"accepted,":[43],"there":[44,152],"accepting":[47,114],"computation":[48],"on":[49,62,110],"$x$":[50],"such":[51,159],"no":[53,85],"pair":[54],"of":[55,59,171,185,204],"input":[56],"heads,":[57],"neither":[58],"$\\$$,":[63],"are":[64,109],"more":[65],"than":[66],"$k$":[67,135,147],"cells":[69],"apart":[70],"at":[71,118],"any":[72],"time":[73],"during":[74],"the":[75,81,103,119,169,183,205],"computation.":[76],"When":[77],"reaches":[80,102],"marker,":[82],"it":[83,129],"can":[84],"longer":[86],"move.":[87],"As":[88],"usual,":[89],"\\ldots,":[95],"accepted":[98],"eventually":[101],"configuration":[104],"where":[105],"all":[106],"$n$":[107],"heads":[108],"in":[112],"state.":[115],"We":[116],"look":[117],"following":[120],"problems:":[121],"(1)":[122],"$M$,":[127],"given":[134],"(for":[136,148],"some":[137,149,210],"$k$)?":[138],"(2)":[140],"$k$),":[150],"does":[151],"exist":[153],"$M'$":[158],"$L(M')":[161],"L(M)$?":[163],"In":[164],"earlier":[165,206],"papers,":[166],"studied":[168],"case":[170,184],"multi-tape":[172,186,190,195],"finite":[173],"automata":[174,176,188],"(these":[175],"accept":[177],"rational":[178],"relations).":[179],"Here,":[180],"investigate":[182],"pushdown":[187],"(NPDAs),":[189],"Turing":[191],"machines,":[192],"other":[194],"models.":[196],"The":[197],"results":[198,207],"obtain":[201],"contrast":[202],"those":[203],"involve":[209],"rather":[211],"intricate":[212],"constructions.":[213]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}