Context free normal systems and ETOL systems

DOI10.1016/0022-0000(83)90019-3zbMATH Open0507.68051OpenAlexW2057262974MaRDI QIDQ1837541FDOQ1837541

Authors: Andrzej Ehrenfeucht, Joost Engelfriet, 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)

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837541)