scientific article; zbMATH DE number 794243
From MaRDI portal
Publication:4847003
Recommendations
- On the property of preserving regularity for string-rewriting systems
- scientific article; zbMATH DE number 176501
- Decidability of regularity and related properties of ground normal form languages
- Some undecidability results concerning the property of preserving regularity
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Cited in
(39)- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- Some undecidability results concerning the property of preserving regularity
- Test sets for the universal and existential closure of regular tree languages.
- Decidability for left-linear growing term rewriting systems.
- Term rewriting restricted to ground terms.
- A property of left-linear rewrite systems preserving recognizability
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
- Iterating transducers
- Syntactic structures of regular languages
- Some decidability results on one-pass reductions
- scientific article; zbMATH DE number 1722706 (Why is no real title available?)
- Regular languages of thin trees
- scientific article; zbMATH DE number 6683507 (Why is no real title available?)
- Extended Watson-Crick L Systems with Regular Trigger Languages
- Closure of Hedge-Automata Languages by Hedge Rewriting
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
- Visibly Pushdown Languages and Term Rewriting
- TAGED Approximations for Temporal Properties Model-Checking
- How to Tackle Integer Weighted Automata Positivity
- scientific article; zbMATH DE number 18637 (Why is no real title available?)
- scientific article; zbMATH DE number 176501 (Why is no real title available?)
- scientific article; zbMATH DE number 1254101 (Why is no real title available?)
- On the property of preserving regularity for string-rewriting systems
- scientific article; zbMATH DE number 2090070 (Why is no real title available?)
- scientific article; zbMATH DE number 1390088 (Why is no real title available?)
- scientific article; zbMATH DE number 1405628 (Why is no real title available?)
- Handling left-quadratic rules when completing tree automata
- Closure of tree automata languages under innermost rewriting
- Towards an Efficient Implementation of Tree Automata Completion
- Reachability analysis over term rewriting systems
- Decidability of regularity and related properties of ground normal form languages
- The HOM problem is EXPTIME-complete
- The weighted HOM-problem over fields
- Weighted HOM-problem for nonnegative integers
- Termination criteria for tree automata completion
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
- A theoretical limit for safety verification techniques with regular fix-point computations
- Equational approximations for tree automata completion
- Murg term rewrite systems
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 Q4847003)
