Stop the war!
Остановите войну!
for scientists:
default search action
"Finite n-tape automata over possibly infinite alphabets: Extending a ..."
Christian Choffrut, Serge Grigorieff (2009)
- Christian Choffrut, Serge Grigorieff:
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. Theor. Comput. Sci. 410(1): 16-34 (2009)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.