{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2458041","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2458041","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2458041","kernelVersion":"v1","immutable":true,"modified":"2026-01-13T12:18:47Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2458041","name":"Equivalence of deterministic pushdown automata revisited","headline":"Equivalence of deterministic pushdown automata revisited","description":"scientific article; zbMATH DE number 5206869","url":"https://portal.mardi4nfdi.de/entity/Q2458041","datePublished":"2007-10-31","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2458040"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q199816"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/S10559-007-0037-7","url":"https://doi.org/10.1007/S10559-007-0037-7"},"sameAs":["https://doi.org/10.1007/S10559-007-0037-7"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5590810"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5639365"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2560718"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4772713"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3777488"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5609393"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1218272"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4571996"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1589483"}]},"provenance":{"prov:generatedAtTime":"2026-01-13T12:18:47Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}