{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/11157"},"canonical_url":"https://search.dev.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/11157","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"Representing processes as Update Automata and Transducers","abstract":"In 2007 Nerode introduced the notion of an update automaton and update transducer to model the evolution of interactions of arbitrary functions on arbitrary domains governed by a finite automaton. We show the scope of this methodology by modeling a variety of processes, including database networks, interactive proofs, finite-state transducers, and financial ledgers. We produce a novel solution method and associated transducers for finite systems of arbitrary-order non-homogeneous linear difference equations over a field using Hermite's unimodular polynomial matrix row reduction. These transducers can be viewed as time invariant linear causal maps of the linear space of sequences of vectors over the base field.","abstract_html":"In 2007 Nerode introduced the notion of an update automaton and update transducer to model the evolution of interactions of arbitrary functions on arbitrary domains governed by a finite automaton. We show the scope of this methodology by modeling a variety of processes, including database networks, interactive proofs, finite-state transducers, and financial ledgers. We produce a novel solution method and associated transducers for finite systems of arbitrary-order non-homogeneous linear difference equations over a field using Hermite's unimodular polynomial matrix row reduction. These transducers can be viewed as time invariant linear causal maps of the linear space of sequences of vectors over the base field.","abstract_has_math":false,"creators":["Adams, Bryant"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2008,"date_issued":"2008-07-27T00:55:51Z","date_published":"2008-07-27T00:55:51Z","updated_at":"2026-07-24T01:48:58Z","subjects":["automata","transducers","state machines","difference equations","modeling"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/11157","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Adams, Bryant"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2008-07-27T00:55:51Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-07-27T06:26:45Z"]},{"key":"dc:date.issued","label":"Date","values":["2008-07-27T00:55:51Z"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["automata","transducers","state machines","difference equations","modeling"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/11157"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In 2007 Nerode introduced the notion of an update automaton and update transducer to model the evolution of interactions of arbitrary functions on arbitrary domains governed by a finite automaton. We show the scope of this methodology by modeling a variety of processes, including database networks, interactive proofs, finite-state transducers, and financial ledgers. We produce a novel solution method and associated transducers for finite systems of arbitrary-order non-homogeneous linear difference equations over a field using Hermite's unimodular polynomial matrix row reduction. These transducers can be viewed as time invariant linear causal maps of the linear space of sequences of vectors over the base field."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Representing processes as Update Automata and Transducers"]}]}],"canonical_facts":{"dc:creator":["Adams, Bryant"],"dc:date.accessioned":["2008-07-27T00:55:51Z"],"dc:date.available":["2013-07-27T06:26:45Z"],"dc:date.issued":["2008-07-27T00:55:51Z"],"dc:description.abstract":["In 2007 Nerode introduced the notion of an update automaton and update transducer to model the evolution of interactions of arbitrary functions on arbitrary domains governed by a finite automaton. We show the scope of this methodology by modeling a variety of processes, including database networks, interactive proofs, finite-state transducers, and financial ledgers. We produce a novel solution method and associated transducers for finite systems of arbitrary-order non-homogeneous linear difference equations over a field using Hermite's unimodular polynomial matrix row reduction. These transducers can be viewed as time invariant linear causal maps of the linear space of sequences of vectors over the base field."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["https://hdl.handle.net/1813/11157"],"dc:language.iso":["en_US"],"dc:subject":["automata","transducers","state machines","difference equations","modeling"],"dc:title":["Representing processes as Update Automata and Transducers"],"dc:type":["dissertation or thesis"]},"updated_at":"2026-07-24T01:48:58Z"}