Hyper-AFLs and ET0L Systems | Zendy

Per Ahlgren Christensen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Hyper-AFLs and ET0L Systems

Author(s) -

Per Ahlgren Christensen

Publication year - 1974

Publication title -

daimi report series

Language(s) - English

Resource type - Journals

eISSN - 2245-9316

pISSN - 0105-8517

DOI - 10.7146/dpb.v3i35.6456

Subject(s) - substitution (logic) , iterated function , rewriting , computer science , natural (archaeology) , arithmetic , mathematics , theoretical computer science , discrete mathematics , programming language , history , mathematical analysis , archaeology

This Paper deals with relations between substitutions and parallel rewriting in the sense of Lindenmayer-systems. We are especially interested in iterated substitution, which was introduced by Jan van Leeuwen and Arlo Salomaa, and which is a generalkation of the EOL- and the ETOL-system. In a natural way these iterated substitutions lead to the notion of a hyper-AFL, and it will be proved that the family of ETOL languages is the smallest hyper-AFL.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research