Paper/The Accounting System as an Algebraic Automaton
Rambaud, Salvador Cruz; Pérez, José García (2005). "The Accounting System as an Algebraic Automaton". INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS. local page: Wiley Periodicals, Inc. 20: 827–842.
Research Synopsis
This content is directly relevant to the book[1]:Algebraic Models for Accounting Systems of the same authors.
Decision problems for Accounting Systems
- Decide whether a given transaction is allowable.
- Decide whether a given balance vector is allowable.
- Decide whether a given transaction is feasible.
- Decide whether a final balance vector could actually have occurred by correctly applying a sequence of allowable transactions to a given initial balance vector.
- Decide whether two accounting systems on the same account set are equivalent, i.e., if they have the same feasible transactions and hence the same monoid.
- Decide whether a given accounting system is of a specific type such as those described in Chapter 7.
References
- ↑ Rambaud, Salvador Cruz; Pérez, José García; Nehmer, Robert A.; Robinson, Derek J S Robinson (2010). Algebraic Models for Accounting Systems. local page: Cambridge at the University Press. ISBN 978-981-4287-11-1.