Bottom-Up Rewriting Is Inverse Recognizability Preserving

DOI10.1007/978-3-540-73449-9_10MaRDI QIDQ5432336zbMATH OpenOpenAlexFDO

Authors Irène Durand, Géraud Sénizergues

Publication date 2 January 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73449-9_10

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Bottom-up rewriting for words and terms
• Left-linear bounded TRSs are inverse recognizability preserving
• A property of left-linear rewrite systems preserving recognizability
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• scientific article; zbMATH DE number 2090067

Cited in

(9)

• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Term rewriting with prefix context constraints and bottom-up strategies
• Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
• scientific article; zbMATH DE number 2090067 (Why is no real title available?)
• Closure of tree automata languages under innermost rewriting
• Left-linear bounded TRSs are inverse recognizability preserving
• Reversible Top-Down Syntax Analysis
• Bottom-up rewriting for words and terms
• Normalization properties for shallow TRS and innermost rewriting

This page was built for publication: Bottom-Up Rewriting Is Inverse Recognizability Preserving

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