Deterministic tree pushdown automata and monadic tree rewriting systems
From MaRDI portal
Publication:1118421
DOI10.1016/0022-0000(88)90014-1zbMath0668.68084MaRDI QIDQ1118421
Publication date: 1988
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(88)90014-1
68Q45: Formal languages and automata
Related Items
Reachability analysis over term rewriting systems, Linear generalized semi-monadic rewrite systems effectively preserve recognizability, Some undecidability results concerning the property of preserving regularity, Bottom-up tree pushdown automata: Classification and connection with rewrite systems, Decidability for left-linear growing term rewriting systems., Term rewriting restricted to ground terms., Congruential complements of ground term rewrite systems, A property of left-linear rewrite systems preserving recognizability, Decidability of EDT0L structural equivalence