scientific article; zbMATH DE number 6146470

DOI10.4230/LIPIcs.STACS.2008.1319zbMath1259.68083MaRDI QIDQ4910734

Artur Jeż, Alexander Okhotin

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_beef.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Word problems, etc. in computability and recursion theory (03D40)

Related Items (4)

Functions Definable by Arithmetic Circuits ⋮ Conjunctive grammars with restricted disjunction ⋮ Conjunctive Grammars with Restricted Disjunction ⋮ One-Nonterminal Conjunctive Grammars over a Unary Alphabet

This page was built for publication: