{"@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/Q6560180","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q6560180","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q6560180","kernelVersion":"v1","immutable":true,"modified":"2026-02-17T21:07:00Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q6560180","name":"Bounded fixed-point definability and tabular recognition of languages","headline":"Bounded fixed-point definability and tabular recognition of languages","description":"scientific article; zbMATH DE number 7869536","url":"https://portal.mardi4nfdi.de/entity/Q6560180","datePublished":"2024-06-21","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q817583"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/3-540-61377-3_50","url":"https://doi.org/10.1007/3-540-61377-3_50"},"sameAs":["https://doi.org/10.1007/3-540-61377-3_50"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3928246"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4850061"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4198075"},{"@id":"https://portal.mardi4nfdi.de/entity/Q802880"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4632444"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3753525"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4474840"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4202947"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1177161"}]},"provenance":{"prov:generatedAtTime":"2026-02-17T21:07:00Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}