A graph-based regularity test for deterministic context-free languages

DOI10.1016/0304-3975(91)90076-EzbMath0753.68055MaRDI QIDQ1177178

Priti Shankar, B. S. Adiga

Publication date: 26 June 1992

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

zbMATH Keywords

context-free languagespushdown automata

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Amalgams of finite inverse semigroups and deterministic context-free languages.

Cites Work

• Regularity and Related Problems for Deterministic Pushdown Automata
• A regularity test for pushdown machines
• Unnamed Item
• Unnamed Item

This page was built for publication: A graph-based regularity test for deterministic context-free languages