The recognizable sets of value trees (pseudoterms) are shown to be exactly projections of sets of derivation trees of (extended) context-free grammars.
A medvedev characterization of sets recognized by generalized finite automata
โ Scribed by O. L. Costich
- Publisher
- Springer
- Year
- 1972
- Tongue
- English
- Weight
- 348 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The problem of identification of the exchange coefficients in a multiphase spacially inhomogeneous transport (plug-flow) system using the tracer technique is solved. Explicit forms are given for evaluating the exchange coe ffwicnts in term~ of the output data. It is shown that identification is achi
Let R n be a real n-dimensional space, let fex j x P g be a family of m j j linear operators in R n , and let u r be a sharp polyhedral cone formed by a set of rvectors, u r & R n X Let u r be invariant under fex j x P g, i.e. u r ex u r , for x P . We study a maximum set of non-collinear vectors de