Representation of rational functions with prefix and suffix codings
From MaRDI portal
Publication:1341724
DOI10.1016/0304-3975(94)90245-3zbMath0823.68055OpenAlexW2026887187MaRDI QIDQ1341724
H. C. M. Kleijn, Alain Terlutte, Tero J.Harju, Michel Latteux
Publication date: 9 January 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90245-3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bifaithful starry transductions
- A note on morphic characterization of languages
- Decidability problems for unary output sequential transducers
- Transductions des langages de Chomsky
- Sur les rélations rationnelles entre monoides libres
- A new proof of two theorems about rational transductions
- Deterministic sequential functions
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets
- A new normal form for the compositions of morphisms and inverse morphisms
- Compositional representation of rational functions
- On Relations Defined by Generalized Finite Automata