Context free normal systems and ETOL systems

DOI10.1016/0022-0000(83)90019-3MaRDI QIDQ1837541zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3646310 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3492162 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3569864 (Why is no real title available?)
• scientific article; zbMATH DE number 3635521 (Why is no real title available?)
• scientific article; zbMATH DE number 3383530 (Why is no real title available?)
• Chains of full AFL's
• Closure properties of some families of languages associated with biological systems
• Decomposition Theorems for Various Kinds of Languages Parallel in Nature
• Formal Reductions of the General Combinatorial Decision Problem
• Intercalation theorems for stack languages
• One-way stack automata
• Tag systems and lag systems
• The Solvability of the Derivability Problem for One-Normal Systems
• Universality of Tag Systems with P = 2

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)