The equivalence problem for real-time strict deterministic pushdown automata

DOI10.1007/BF01075213MaRDI QIDQ4007337zbMATH OpenFDO

Authors V. Yu. Mejtus

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

equivalencepushdown automatareal-time

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3490487 (Why is no real title available?)
• scientific article; zbMATH DE number 3314372 (Why is no real title available?)
• The equivalence problem for real-time strict deterministic languages

Cited in

(3)

• Complete formal systems for equivalence problems
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines

This page was built for publication: The equivalence problem for real-time strict deterministic pushdown automata

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