date: 2023-04-20T01:19:06Z
pdf:PDFVersion: 1.4
pdf:docinfo:title: Unboundedness Problems for Machines with Reversal-Bounded Counters
xmp:CreatorTool: LaTeX with hyperref
access_permission:can_print_degraded: true
subject: Foundations of Software Science and Computation Structures, doi:10.1007/978-3-031-30829-1_12
pdfa:PDFVersion: A-2b
xmpMM:History:Action: converted
language: EN
dc:format: application/pdf; version=1.4
pdf:docinfo:custom:robots: noindex
pdf:docinfo:creator_tool: LaTeX with hyperref
access_permission:fill_in_form: true
xmpMM:History:When: 2023-04-18T21:24:39Z
pdf:encrypted: false
dc:title: Unboundedness Problems for Machines with Reversal-Bounded Counters
modified: 2023-04-20T01:19:06Z
cp:subject: Foundations of Software Science and Computation Structures, doi:10.1007/978-3-031-30829-1_12
xmpMM:History:SoftwareAgent: pdfToolbox
pdf:docinfo:custom:CrossMarkDomains[1]: springer.com
robots: noindex
pdf:docinfo:subject: Foundations of Software Science and Computation Structures, doi:10.1007/978-3-031-30829-1_12
xmpMM:History:InstanceID: uuid:d300fae8-adf4-47d2-9d1c-3eb6b322dc06
pdf:docinfo:creator: Pascal Baumann
meta:author: Flavio D?Alessandro
trapped: Unknown
meta:creation-date: 2023-04-12T11:27:39Z
pdf:docinfo:custom:CrossmarkMajorVersionDate: 2010-04-23
created: 2023-04-12T11:27:39Z
access_permission:extract_for_accessibility: true
Creation-Date: 2023-04-12T11:27:39Z
pdfaid:part: 2
pdf:docinfo:custom:CrossMarkDomains[2]: springerlink.com
pdf:docinfo:custom:doi: 10.1007/978-3-031-30829-1_12
pdf:docinfo:custom:CrossmarkDomainExclusive: true
Author: Flavio D?Alessandro
producer: pdfTeX-1.40.24
CrossmarkDomainExclusive: true
pdf:docinfo:producer: pdfTeX-1.40.24
doi: 10.1007/978-3-031-30829-1_12
pdf:unmappedUnicodeCharsPerPage: 2
dc:description: Foundations of Software Science and Computation Structures, doi:10.1007/978-3-031-30829-1_12
Keywords: Formal languages; Decidability; Complexity; Counter automata; Reversal-bounded; Pushdown; Boundedness; Unboundedness
access_permission:modify_annotations: true
dc:creator: Flavio D?Alessandro
description: Foundations of Software Science and Computation Structures, doi:10.1007/978-3-031-30829-1_12
dcterms:created: 2023-04-12T11:27:39Z
Last-Modified: 2023-04-20T01:19:06Z
dcterms:modified: 2023-04-20T01:19:06Z
title: Unboundedness Problems for Machines with Reversal-Bounded Counters
xmpMM:DocumentID: uuid:d1a11fdc-6653-4a10-9dfd-150b35918e63
Last-Save-Date: 2023-04-20T01:19:06Z
CrossMarkDomains[1]: springer.com
pdf:docinfo:keywords: Formal languages; Decidability; Complexity; Counter automata; Reversal-bounded; Pushdown; Boundedness; Unboundedness
pdf:docinfo:modified: 2023-04-20T01:19:06Z
meta:save-date: 2023-04-20T01:19:06Z
Content-Type: application/pdf
X-Parsed-By: org.apache.tika.parser.DefaultParser
creator: Flavio D?Alessandro
pdfaid:conformance: B
dc:language: EN
dc:subject: Formal languages; Decidability; Complexity; Counter automata; Reversal-bounded; Pushdown; Boundedness; Unboundedness
access_permission:assemble_document: true
xmpTPg:NPages: 25
pdf:charsPerPage: 2211
access_permission:extract_content: true
access_permission:can_print: true
pdf:docinfo:trapped: Unknown
CrossMarkDomains[2]: springerlink.com
meta:keyword: Formal languages; Decidability; Complexity; Counter automata; Reversal-bounded; Pushdown; Boundedness; Unboundedness
access_permission:can_modify: true
pdf:docinfo:created: 2023-04-12T11:27:39Z
CrossmarkMajorVersionDate: 2010-04-23