Context-free languages and rudimentary attributes

DOI10.1007/BF01746515zbMath0179.02202OpenAlexW2027256733MaRDI QIDQ5569455

Neil D. Jones

Publication date: 1969

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01746515

zbMATH Keywords

languages, automata, networks

Related Items (10)

Unnamed Item ⋮ Rudimentary relations and primitive recursion: A toolbox ⋮ Positive rudimentarity of the graphs of Ackermann and Grzegorczyk ⋮ Mit regulären Grundbegriffen definierbare Prädikate ⋮ The role of rudimentary relations in complexity theory ⋮ Rudimentary relations and stack languages ⋮ Corrigendum: Context free languages and rudimentary attributes ⋮ Bounded arithmetic, proof complexity and two papers of Parikh ⋮ Theory of formal grammars ⋮ Nonerasing, counting, and majority over the linear time hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• On certain formal properties of grammars
• Theory of Formal Systems. (AM-47)
• Classes of languages and linear-bounded automata
• Three theorems on phrase structure grammars of type 1

This page was built for publication: Context-free languages and rudimentary attributes