Deciding confluence for a simple class of relational transducer networks
From MaRDI portal
Publication:269334
DOI10.1007/S00224-015-9624-6zbMath1352.68077OpenAlexW317354346MaRDI QIDQ269334
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
Database theory (68P15) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Specification and verification of data-driven Web applications
- 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
- Relational transducers for declarative networking
- A variant of a recursively unsolvable problem
This page was built for publication: Deciding confluence for a simple class of relational transducer networks