Context free normal systems and ETOL systems

DOI10.1016/0022-0000(83)90019-3zbMath0507.68051OpenAlexW2057262974MaRDI QIDQ1837541

Joost Engelfriet, Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90019-3

zbMATH Keywords

rewriting systemsEOL languagesECFN languagesextended context free normal systemsTag system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Comparison of basic language generating devices (non-deterministic systems)

Cites Work

• Tag systems and lag systems
• Decomposition Theorems for Various Kinds of Languages Parallel in Nature
• Closure properties of some families of languages associated with biological systems
• Intercalation theorems for stack languages
• Universality of Tag Systems with P = 2
• One-way stack automata
• Chains of full AFL's
• The Solvability of the Derivability Problem for One-Normal Systems
• Formal Reductions of the General Combinatorial Decision Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Context free normal systems and ETOL systems