Abstract and concrete categories
Abstract and concrete categories
A proof of Choffrut's theorem on subsequential functions
Theoretical Computer Science
Journal of the ACM (JACM)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Automata, Languages, and Machines
Automata, Languages, and Machines
Determinization of transducers over finite and infinite words
Theoretical Computer Science
Minimizing subsequential transducers: a survey
Theoretical Computer Science
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Subsequential Functions: Characterizations, Minimization, Examples
Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Automata and Coinduction (An Exercise in Coalgebra)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A note on coinduction and weak bisimilarity for while programs
A note on coinduction and weak bisimilarity for while programs
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Finite-state transducers in language and speech processing
Computational Linguistics
Automata and fixed point logic: a coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
PSPACE Bounds for Rank-1 Modal Logics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Subsequential transducers: a coalgebraic perspective
Information and Computation
Hi-index | 0.00 |
Subsequential transducers generalise both classic deterministic automata and Mealy/Moore type state machines by combining (input) language recognition with transduction. In this paper we show that normalisation and taking differentials of subsequential transducers and their underlying structures can be seen as coalgebraisation. More precisely, we show that the subclass of normalised subsequential structures is a category of coalgebras which is reflective in the category of coaccessible subsequential structures, and which has a final object. This object is then also final for coaccessible structures. The existence and properties of the minimal subsequential transducer realising a partial word function f can be derived from this result. We also show that subsequential structures in which all states are accepting, can be seen as coalgebras by taking differentials. The coalgebraic representation obtained in this way gives rise to an alternative method of deciding transducer equivalence.