scientific article; zbMATH DE number 18637

MaRDI QIDQ3976041zbMATHFDO

Authors Emmanuel Kounalis

Publication date 26 June 1992

zbMATH Keywords

finitenessnegation as failureequationsfinite modelslearning from exampleslanguage representationpumping lemmasrewrite systemsproof by inductioncontext- sensitive languagescompiling pattern matchingground normal forms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• A pumping lemma for output languages of macro tree transducers
• Pumping lemmas for classes of languages generated by folding systems
• scientific article; zbMATH DE number 794243
• scientific article; zbMATH DE number 1615227
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Rewriting preserving recognizability of finite tree languages
• Bottom-up tree pushdown automata and rewrite systems
• Deterministic bottom-up tree transducers and ground term rewrite systems
• On relationship between term rewriting systems and regular tree languages

Cited in

(4)

• Testing for the ground (co-)reducibility property in term-rewriting systems
• Restricting tree grammars with term rewriting
• Pumping lemmas for classes of languages generated by folding systems
• Mechanizable inductive proofs for a class of \(\forall \exists\) formulas

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976041)