Copyless cost-register automata: structure, expressiveness, and closure properties
From MaRDI portal
Publication:1740663
DOI10.1016/j.jcss.2018.07.002zbMath1421.68050OpenAlexW2891845862MaRDI QIDQ1740663
Cristian Riveros, Filip Mazowiecki
Publication date: 2 May 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5754/
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (7)
Polynomially ambiguous unary weighted automata over fields ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Closure and nonclosure properties of the classes of compressible and rankable sets ⋮ Unnamed Item ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields ⋮ A robust class of linear recurrence sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook of weighted automata
- On the degree of ambiguity of finite automata
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Weighted automata and weighted logics
- Streaming Tree Transducers
- What’s Decidable about Weighted Automata?
- Weak Second‐Order Arithmetic and Finite Automata
- On the definition of a family of automata
- Top-down tree transducers with regular look-ahead
- Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties
- The equality problem for rational series with multiplicities in the tropical semiring is undecidable
- Regular Functions and Cost Register Automata
- Quantitative Monadic Second-Order Logic
- Decision Problems for Additive Regular Functions
- Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata
- Streaming transducers for algorithmic verification of single-pass list-processing programs
This page was built for publication: Copyless cost-register automata: structure, expressiveness, and closure properties
