The decidability of the FOL-DOL equivalence problem
From MaRDI portal
Publication:1256322
DOI10.1016/0020-0190(79)90119-4zbMath0403.68068MaRDI QIDQ1256322
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90119-4
68Q45: Formal languages and automata
Related Items
Lindenmayer Systems, Watson-Crick D0L systems with regular triggers, The decidability of the DOL-DTOL equivalence problem, The language equivalence problem for HD0L systems having D0L growths, The equivalence problem for DF0L languages and power series.
Cites Work