You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton

Price: EUR 27.50