Over Which Monoids is the Transducer Determinization Procedure Applicable?
From MaRDI portal
Publication:5739012
DOI10.1007/978-3-319-53733-7_28zbMath1485.68141OpenAlexW2589021376MaRDI QIDQ5739012
Stefan Gerdjikov, Stoyan Mihov
Publication date: 1 June 2017
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53733-7_28
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Cites Work
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Sequential?
- A Generalised Twinning Property for Minimisation of Cost Register Automata
- Unnamed Item