Universality of R-automata with Value Copying

DOI10.1016/j.entcs.2009.05.035zbMath1347.68203OpenAlexW2114978526MaRDI QIDQ5179055

Pavel Krcal, Wang Yi, Parosh Aziz Abdulla

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.035

zbMATH Keywords

universalitydecidabilitydistance automata with resets and copying

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Limitedness theorem on finite automata with distance functions: An algebraic proof
• Improved limitedness theorems on finite automata with distance functions
• Factorization forests of finite height
• Limitedness theorem on finite automata with distance functions
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• R-Automata
• On semigroups of matrices over the tropical semiring
• Foundations of Software Science and Computation Structures
• Distance desert automata and the star height problem
• Factorisation Forests for Infinite Words
• Sampled Universality of Timed Automata
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Universality of R-automata with Value Copying