On depth in EDTOL languages

DOI10.1016/0304-3975(83)90053-1MaRDI QIDQ1836481zbMATH OpenOpenAlexFDO

Authors Gerald S. Eisman

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90053-1

zbMATH Keywords

digraphsfinite state automataedge cycle rankEDTOL languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• scientific article; zbMATH DE number 3358495 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• On ETOL systems with rank
• Transition graphs and the star-height of regular events

Cited in

(1)

• On the ratio of growth functions in EDTOL languages

This page was built for publication: On depth in EDTOL languages

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