The equivalence problem for real-time strict deterministic pushdown automata
From MaRDI portal
Publication:4007337
DOI10.1007/BF01075213zbMath0800.68425MaRDI QIDQ4007337
Publication date: 27 September 1992
Published in: Cybernetics (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines, Complete formal systems for equivalence problems, \(L(A)=L(B)\)? decidability results from complete formal systems
Cites Work