The equivalence problem for real-time strict deterministic pushdown automata

DOI10.1007/BF01075213zbMATH Open0800.68425MaRDI QIDQ4007337FDOQ4007337

Authors: V. Yu. Mejtus 

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

equivalencereal-timepushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• The equivalence problem for real-time strict deterministic languages
• Title not available (Why is that?)

Cited In (3)

• \(L(A)=L(B)\)? decidability results from complete formal systems
• Complete formal systems for equivalence problems
• 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)