Deterministic acceptors for indexed languages

DOI10.1007/BF02733110zbMath0917.68122OpenAlexW2071486125MaRDI QIDQ1280912

L. P. Lisovik

Publication date: 28 April 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02733110

zbMATH Keywords

indexed languagenondeterministic lineraly bounded automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Recognition of perfect labeled trees with regularity condition
• Optimization of LR(k) parsers
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: Deterministic acceptors for indexed languages