Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Pumping-like results for copyless cost register automata and polynomially ambiguous weighted automata
Authors:ID Mazowiecki, Filip (Author)
ID Puch, Antoni (Author)
ID Smertnig, Daniel (Author)
Files:.pdf PDF - Presentation file, download (1,21 MB)
MD5: 11736C788E7ADEBF29895D958388B00C
 
URL URL - Source URL, visit https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.67
 
Language:English
Typology:1.08 - Published Scientific Conference Contribution
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:In this work we consider two rich subclasses of weighted automata over fields: polynomially ambiguous weighted automata and copyless cost register automata. Primarily we are interested in understanding their expressiveness power. Over the field of rationals and 1-letter alphabets, it is known that the two classes coincide; they are equivalent to linear recurrence sequences (LRS) whose exponential bases are roots of rationals. We develop a tool we call Pumping Sequence Families, which, by exploiting the simple single-letter behaviour of the models, yields two pumping-like results over arbitrary fields with unrestricted alphabets, one for each class. As a corollary of these results, we present examples proving that the two classes become incomparable over the field of rationals with unrestricted alphabets. We complement the results by analysing the zeroness and equivalence problems. For weighted automata (even unrestricted) these problems are well understood: there are polynomial time, and even NC$^2$ algorithms. For copyless cost register automata we show that the two problems are PSpace-complete, where the difficulty is to show the lower bound.
Keywords:weighted automata, cost register automata, ambiguity, linear recurrence sequences, equivalence problem
Publication status:Published
Publication version:Version of Record
Year of publishing:2026
Number of pages:str. 67:1-67:21
PID:20.500.12556/DiRROS-29429 New window
UDC:004:511
ISSN on article:1868-8969
DOI:10.4230/LIPIcs.STACS.2026.67 New window
COBISS.SI-ID:278513155 New window
Note:
Publication date in DiRROS:18.05.2026
Views:27
Downloads:17
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a proceedings

Title:43rd International Symposium on Theoretical Aspects of Computer Science
COBISS.SI-ID:278507011 New window

Record is a part of a journal

Title:Leibniz international proceedings in informatics
Shortened title:Leibniz int. proc. inform.
Publisher:Schloss Dagstuhl, Leibniz-Zentrum für Informatik
ISSN:1868-8969
COBISS.SI-ID:523260441 New window

Document is financed by a project

Funder:Other - Other funder or multiple funders
Funding programme:National Center for Science (Narodowe Centrum Nauki)
Project number:2022/46/E/ST6/00230
Name:/

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0288
Name:Algebra in njena uporaba

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-60025
Name:Interakcija aritmetičnih lastnosti in algebraične strukture v nekomutativnih kolobarjih

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:končni avtomati, linearna rekurzivna zaporedja


Back