A fast algorithm for constructing a tree automaton recognizing a congruential tree language
From MaRDI portal
Publication:1261478
DOI10.1016/0304-3975(93)90127-FzbMath0781.68081MaRDI QIDQ1261478
Publication date: 3 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
08A70: Applications of universal algebra in computer science
68Q42: Grammars and rewriting systems
Related Items
CHAP and rewrite components, Intersection of finitely generated congruences over term algebra, Term rewriting restricted to ground terms., On ground tree transformations and congruences induced by tree automata., Congruential complements of ground term rewrite systems, Restricted ground tree transducers, Derivation trees of ground term rewriting systems.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Fast Decision Procedures Based on Congruence Closure
- Variations on the Common Subexpression Problem
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient ground completion
- Tree generating regular systems