Titlebook: Automata, Languages and Programming; 2nd Colloquium, Univ Jacques Loeckx Conference proceedings 1974 Springer Berlin Heidelberg 1974 Automa

僵硬

蕨類(lèi)

Checking Stacks and Context-Free Programmed Grammars Accept p-complete LanguagesIt is well known that, for a given context-free grammar G, the recognition problem “x ∈ L(G)” can be decided in 0(|x|). steps by a suitable algorithm. How do extensions behave in this respect? In particular, do they admit recognition algorithms whose time is polynomially bounded by the length of the

財(cái)主

Fortuitous

Dynamic Programming Schematat theory for lattices, is given. Furthermore it is shown that a dynamic programming problem can be formulated in a suitable regular algebra and the system can be solved using Gaussian elimination..A dynamic programming problem can be posed independently of the particular values of functions and cons