Deciding confluence for a simple class of relational transducer networks
DOI10.1007/S00224-015-9624-6zbMATH Open1352.68077OpenAlexW317354346MaRDI QIDQ269334FDOQ269334
Authors: Tom J. Ameloot, Jan Van den Bussche 
Publication date: 18 April 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/20633
Recommendations
- Relational transducers for declarative networking
- Publication:4936134
- On efficient recognition of transductions and relations
- Deciding the confluence of ordered term rewrite systems
- scientific article; zbMATH DE number 1303445
- scientific article; zbMATH DE number 3928342
- Single network relational transductive learning
- Confluence in probabilistic rewriting
- Deciding confluence of certain term rewriting systems in polynomial time
Formal languages and automata (68Q45) Database theory (68P15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification of relational transducers for electronic commerce
- Relational transducers for electronic commerce
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture
- Relational transducers for declarative networking
- A variant of a recursively unsolvable problem
- Specification and verification of data-driven Web applications
Cited In (4)
This page was built for publication: Deciding confluence for a simple class of relational transducer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269334)
