Within the last year
Within the past 3 years
1 - 2 of 2 articles
The graphic representation for the structural description of an arbitrary semi-thue derivation is called a derivation structure. Arbitrary phrase structure grammars and generalized finite automata are regarded primarily as derivation structure definition systems. The languages they define are...
Given any simply consistent formal theory F of the state complexity L(S) of finite binary sequences S as computed by 3-tape-symbol Turing machines, there exists a natural number L(F) such that L(S) > n is provable in F only if n < L(F). On the other hand, almost all finite binary sequences S...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.