2007•Cybernetics and Systems AnalysisRequires access
Equivalence of deterministic pushdown automata revisited
V. Yu. Meitus
Open publisher page 0 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
V. Yu. Meitus
Abstract
An abstract is not available in the OpenAlex record for this paper.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Embedded pushdown automaton, Deterministic pushdown automaton, Deterministic context-free grammar, Pushdown automaton, Decidability, Equivalence (formal languages), Nested word, Computer science