Approximating deterministic lattice automata

DOI10.1007/978-3-642-33386-6_4MaRDI QIDQ4649285zbMATH OpenOpenAlexFDO

Authors Shulamit Halamish, Orna Kupferman

Publication date 21 November 2012

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33386-6_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Minimizing deterministic lattice automata
• Minimizing deterministic lattice automata
• Finite automata theory with membership values in lattices
• Lattice Automata
• Lattice Minimal Automata and Lattice Reduced Automata

Cited in

(7)

• Inherent vacuity in lattice automata
• Minimizing deterministic lattice automata
• Lattice Automata
• Learning and characterizing fully-ordered lattice automata
• scientific article; zbMATH DE number 2240006 (Why is no real title available?)
• Minimizing deterministic lattice automata
• Multi-valued automata and their applications

This page was built for publication: Approximating deterministic lattice automata

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