scientific article; zbMATH DE number 3634243
zbMath0408.03035MaRDI QIDQ4194950
A. S. Barashko, S. I. Rojzen, V. A. Lipskaya
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MonographComputational ComplexityContext-Free GrammarTuring MachineComputable FunctionFinite Automata EquivalenceFormal GrammarHierarchies Of Complexity ClassesKernel of Partial Recursive FunctionMarkov Process Of Word GenerationNondeterministic Two-Side Pushdown AutomataNontrivial Set
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
This page was built for publication: