Deterministic acceptors for indexed languages

DOI10.1007/BF02733110MaRDI QIDQ1280912zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3924162
• Linear indexed languages
• Indexed counter languages
• scientific article; zbMATH DE number 3963215
• On infinite words determined by indexed languages

Cites work

• scientific article; zbMATH DE number 3894494 (Why is no real title available?)
• Indexed Grammars—An Extension of Context-Free Grammars
• Optimization of LR(k) parsers
• Recognition of perfect labeled trees with regularity condition

Cited in

(1)

• On store languages of language acceptors

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

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