Publication:4910734
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2008.1319zbMath1259.68083MaRDI QIDQ4910734
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_beef.html
68Q45: Formal languages and automata
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03D40: Word problems, etc. in computability and recursion theory