Using acceptors as transducers
Theoretical Computer Science
Using Acceptors as Transducers
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Theoretical Computer Science
On the Decidability of Bounded Valuedness for Transducers
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Decidability of the Equivalence for k-Valued Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A combinatorial study of k-valued rational relations
Journal of Automata, Languages and Combinatorics
Automatic structures of bounded degree revisited
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Nondeterministic streaming string transducers
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the containment and equivalence problems for GSMs, transducers, and linear CFGs
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science
Computing degree of parallelism for BPMN processes
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
| Hi-index | 0.00 |