On recursion in ETOL systems

DOI10.1016/0022-0000(79)90027-8MaRDI QIDQ1137387zbMATH OpenOpenAlexFDO

Authors Grzegorz Rozenberg, Dirk Vermeir

Publication date 1979

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(79)90027-8

zbMATH Keywords

rankfinite indexETOL systemslanguage generating capacitymetalinear ETOL languagesrecursiveness for nonterminal symbols

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3646304 (Why is no real title available?)
• scientific article; zbMATH DE number 3711430 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• An analysis of grammars by their derivation sets
• Description of developmental languages using recurrence systems
• Finite-Turn Pushdown Automata
• More on ETOL systems versus random context grammars
• On ETOL systems of finite index
• On ETOL systems with rank
• On the effect of the finite index restriction on several families of grammars
• TOL schemes and control sets

Cited in

(3)

• On ETOL systems with rank
• Tree transducers, L systems, and two-way machines
• MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS

This page was built for publication: On recursion in ETOL systems

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