Complementable normal form of parametrized automata

DOI10.1007/978-3-032-02602-6_1MaRDI QIDQ6861702zbMATH OpenFDO

Authors Franziska Alber, Philipp Rümmer

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-02602-6_1

zbMATH Keywords

complementationinfinite alphabetsparametrized automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Decision procedures for sequence theories
• Descriptional complexity of machines with limited resources
• Finite-memory automata
• scientific article; zbMATH DE number 5194318 (Why is no real title available?)
• Reasoning on data words over numeric domains
• Self-stabilizing systems in spite of distributed control
• Symbolic register automata
• The power of symbolic automata and transducers
• Variable automata over infinite alphabets

This page was built for publication: Complementable normal form of parametrized automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861702)