On depth in EDTOL languages

DOI10.1016/0304-3975(83)90053-1zbMath0505.68036OpenAlexW2045275800MaRDI QIDQ1836481

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)

Related Items (1)

On the ratio of growth functions in EDTOL languages

Cites Work

• On ETOL systems with rank
• Transition graphs and the star-height of regular events
• Unnamed Item
• Unnamed Item
• Unnamed Item

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