On the public citation graph
Pushdown tree automata
0 signed · 94 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1007/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
inferredcites →https://doi.org/10.1007/bf01744297openalex-snapshot
Formal computations of non deterministic recursive program schemes
inferredcites →https://doi.org/10.1007/bf01768471openalex-snapshot
On jump-deterministic pushdown automata
inferredcites →https://doi.org/10.1016/0304-3975(81)90055-4openalex-snapshot
DPDA's in ‘atomic normal form’ and applications to equivalence problems
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50014-2openalex-snapshot
SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferredcites →https://doi.org/10.1016/s0019-9958(80)90698-1openalex-snapshot
Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
inferredcites →https://doi.org/10.1051/ita/197610r100051openalex-snapshot
Transductions de forêts reconnaissables monadiques, forêts corégulières
inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/800161.805156openalex-snapshot
Tree-oriented proofs of some theorems on context-free and indexed languages
inferredcites →https://doi.org/10.3138/9781487592769-008openalex-snapshot
Explicit Definitions and Linguistic Dominoes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.2908openalex-snapshot
Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series
inferred← citeshttps://doi.org/10.1006/jcss.1998.1573openalex-snapshot
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
inferred← citeshttps://doi.org/10.1007/11605157_11openalex-snapshot
Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_34openalex-snapshot
Alphabetic Pushdown Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_3openalex-snapshot
The Delta Operation: From Strings to Trees to Strings
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_91openalex-snapshot
Pushdown automata on infinite trees and omega-Kleene closure of context-free tree sets
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_43openalex-snapshot
Tree language problems in pattern recognition theory
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_104openalex-snapshot
Bottom-up tree pushdown automata and rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_14openalex-snapshot
Empty stack Pushdown ω-tree automata
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_5openalex-snapshot
Block-Synchronization Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-031-33264-7_15openalex-snapshot
Tree-Walking-Storage Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-08846-4_22openalex-snapshot
Pushdown Machines for Weighted Context-Free Tree Translation
inferred← citeshttps://doi.org/10.1007/978-3-319-23021-4_16openalex-snapshot
Complexity of Uniform Membership of Context-Free Tree Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_44openalex-snapshot
Restarting Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_13openalex-snapshot
Tree Automata with Memory, Visibility and Structural Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_17openalex-snapshot
Visibly Pushdown Languages and Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-75414-5_18openalex-snapshot
Restarting Tree Automata and Linear Context-Free Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_9openalex-snapshot
Weighted Tree Automata and Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_16openalex-snapshot
Variable Tree Automata over Infinite Ranked Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_13openalex-snapshot
Controlled Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-662-44121-3_6openalex-snapshot
A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_12openalex-snapshot
An Automata Characterisation for Multiple Context-Free Languages
inferred← citeshttps://doi.org/10.1007/bf02915449openalex-snapshot
High level tree transducers and iterated pushdown tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0015742openalex-snapshot
Characterization of high level tree transducers
inferred← citeshttps://doi.org/10.1007/s00224-003-1072-zopenalex-snapshot
Tree Series Transformations that Respect Copying
inferred← citeshttps://doi.org/10.1007/s002249910004openalex-snapshot
Spinal-Formed Context-Free Tree Grammars
inferred← citeshttps://doi.org/10.1007/s00236-025-00488-wopenalex-snapshot
Deterministic real-time tree-walking-storage automata
inferred← citeshttps://doi.org/10.1007/s00236-026-00522-5openalex-snapshot
Deterministic tree-walking-storage automata
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00022-0openalex-snapshot
On two-way tree automata
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00048-8openalex-snapshot
Yield-languages of two-way pushdown tree automata
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90014-1openalex-snapshot
Deterministic tree pushdown automata and monadic tree rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90089-1openalex-snapshot
Reductions in tree replacement systems
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90052-6openalex-snapshot
Pushdown machines for the macro tree transducer
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90183-0openalex-snapshot
Variétés d'automates descendants d'arbres infinis
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90158-xopenalex-snapshot
Generalized automata on infinite trees and Muller-McNaughton's Theorem
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90124-xopenalex-snapshot
A geometric hierarchy beyond context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90099-xopenalex-snapshot
Synchronized tree automata
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90101-5openalex-snapshot
Bottom-up tree pushdown automata: classification and connection with rewrite systems
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00073-4openalex-snapshot
Decidability of equivalence for deterministic synchronized tree automata
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90046-1openalex-snapshot
Automata on infinite objects and their applications to logic and programming
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.015openalex-snapshot
Rigid tree automata and applications
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104816openalex-snapshot
Linear weighted tree automata with storage and inverse linear tree homomorphisms
inferred← citeshttps://doi.org/10.1016/j.ijar.2021.12.002openalex-snapshot
Lattice-valued tree pushdown automata: Pumping lemma and closure properties
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00197-9openalex-snapshot
Decidability of EDT0L structural equivalence
inferred← citeshttps://doi.org/10.1142/s0129054117400056openalex-snapshot
Regular Approximation of Weighted Linear Context-Free Tree Languages
inferred← citeshttps://doi.org/10.1145/3485514openalex-snapshot
Study of the subtyping machine of nominal subtyping with variance
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.248openalex-snapshot
Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata
inferred← citeshttps://doi.org/10.2168/lmcs-4(2:8)2008openalex-snapshot
Visibly Tree Automata with Memory and Constraints
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-26openalex-snapshot
Weighted Regular Tree Grammars with Storage
inferred← citeshttps://doi.org/10.3233/fi-1998-3613openalex-snapshot
On the Size of Stack and Synchronization Alphabets of Tree Automata
inferred← citeshttps://doi.org/10.4204/eptcs.388.7openalex-snapshot
Deterministic Real-Time Tree-Walking-Storage Automata
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.163openalex-snapshot
Ordered Tree-Pushdown Systems
inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.187openalex-snapshot
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:25)2022openalex-snapshot
Regular matching problems for infinite trees
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0683openalex-snapshot
Context-Free Grammars with Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1409.6112openalex-snapshot
Dyck-based characterizations of Indexed Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1606.02975openalex-snapshot
An automata characterisation for multiple context-free languages
inferred← citeshttps://doi.org/10.48550/arxiv.2009.04437openalex-snapshot
Ties between Parametrically Polymorphic Type Systems and Finite Control Automata
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0608033openalex-snapshot
A Study on Learnability for Rigid Lambek Grammars
inferred← citeshttps://doi.org/10.5120/11833-7551openalex-snapshot
Biological Motif Discovery Algorithm based on Mining Tree Structure
inferred← citeshttps://doi.org/10.55937/sut/991985554openalex-snapshot
A Comparison of Bottom-Up Pushdown Tree Transducers and Top-Down Pushdown Tree Transducers
inferred← citeshttps://doi.org/10.70675/6466009fz6cb0z4f56z95a2zb45685141114openalex-snapshot
Langages ε-sûrs et caractérisations des langages d'ordres supérieurs
inferred← citeshttps://doi.org/10.70675/98022161z28f5z45a8za356z714fd4718e68openalex-snapshot
Tree automata with global constraints for the verification of security properties
inferred← citeshttps://doi.org/10.70675/ce5447cezb7f1z45c3zaa9az916e8f3dc4f5openalex-snapshot
Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.