{"id":"https://openalex.org/W2565428819","doi":"https://doi.org/10.3233/fi-2016-1436","title":"Visibly Pushdown Automata and Transducers with Counters","display_name":"Visibly Pushdown Automata and Transducers with Counters","publication_year":2016,"publication_date":"2016-12-24","ids":{"openalex":"https://openalex.org/W2565428819","doi":"https://doi.org/10.3233/fi-2016-1436","mag":"2565428819"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2016-1436","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1436","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5110211208","display_name":"\u00d3scar H. Ibarra","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Oscar H. Ibarra","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA 93106, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110211208"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":1.8024,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.87320799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"148","issue":"3-4","first_page":"291","last_page":"308"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9977999925613403,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9975000023841858,"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/decidability","display_name":"Decidability","score":0.80708909034729},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7418076992034912},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6399120688438416},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.5375696420669556},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5359405279159546},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5176625847816467},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5139017105102539},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4903562068939209},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.46662864089012146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4651426374912262},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4600943922996521},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4376300871372223},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4296583831310272},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4202438294887543},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.3987038731575012},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2524540424346924},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.23277530074119568},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.18381941318511963},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.14401239156723022}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.80708909034729},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7418076992034912},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6399120688438416},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.5375696420669556},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5359405279159546},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5176625847816467},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5139017105102539},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4903562068939209},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.46662864089012146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4651426374912262},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4600943922996521},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4376300871372223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4296583831310272},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4202438294887543},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3987038731575012},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2524540424346924},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.23277530074119568},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.18381941318511963},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.14401239156723022},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2016-1436","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1436","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W132160068","https://openalex.org/W147131300","https://openalex.org/W182003119","https://openalex.org/W1011881654","https://openalex.org/W1495774331","https://openalex.org/W1599939219","https://openalex.org/W1850316734","https://openalex.org/W1888293876","https://openalex.org/W2002089154","https://openalex.org/W2011523226","https://openalex.org/W2023999667","https://openalex.org/W2028475750","https://openalex.org/W2032759707","https://openalex.org/W2064776283","https://openalex.org/W2076858908","https://openalex.org/W2084335565","https://openalex.org/W2100590693","https://openalex.org/W2151033407","https://openalex.org/W2170953202","https://openalex.org/W3021915497"],"related_works":["https://openalex.org/W392685101","https://openalex.org/W2067895928","https://openalex.org/W2171067235","https://openalex.org/W2522490152","https://openalex.org/W1511257926","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W2950941115","https://openalex.org/W2047588061","https://openalex.org/W1804899877"],"abstract_inverted_index":{"We":[0,20,64,115],"generalize":[1],"the":[2,25,46,70,85,94,118],"models":[3],"of":[4,24,37,73,96],"visibly":[5,10],"pushdown":[6,11],"automata":[7],"(VPDAs)":[8],"and":[9,29,35,54,76,82,87,92,105,112,120],"transducers":[12],"(VPDTs)":[13],"by":[14],"equipping":[15],"them":[16],"with":[17],"reversal-bounded":[18,77],"counters.":[19],"show":[21,83],"that":[22,68,84,93],"some":[23],"results":[26,51],"for":[27,39],"VPDAs":[28],"VPDTs":[30],"(e.g.,":[31,52],"closure":[32,55],"under":[33,56,102],"intersection":[34],"decidability":[36],"emptiness":[38],"VPDA":[40,75],"languages)":[41],"carry":[42,60],"ove":[43],"r":[44],"to":[45],"generalized":[47],"models,":[48],"but":[49],"other":[50],"determinization":[53],"complementation)":[57],"do":[58],"not":[59],"over,":[61],"in":[62],"general.":[63],"define":[65,99],"a":[66,74],"model":[67],"combines":[69],"desirable":[71],"features":[72],"counters,":[78],"called":[79],"2-phase":[80],"VPCM,":[81],"deterministic":[86],"nondeterministic":[88],"versions":[89],"are":[90],"equivalent":[91],"family":[95],"languages":[97],"they":[98],"is":[100],"closed":[101],"Boolean":[103],"operations":[104],"has":[106],"decidable":[107],"emptiness,":[108],"infiniteness,":[109],"disjointness,":[110],"containment,":[111],"equivalence":[113],"problems.":[114],"also":[116],"investigate":[117],"finite-ambiguity":[119],"finite-valuedness":[121],"problems":[122],"concerning":[123],"these":[124],"devices.":[125]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-03T06:03:33.228499","created_date":"2025-10-10T00:00:00"}