Approximating deterministic lattice automata

DOI10.1007/978-3-642-33386-6_4zbMATH Open1375.68073OpenAlexW106975791MaRDI QIDQ4649285FDOQ4649285

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

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

Mathematics Subject Classification ID

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

Cited In (7)

• Minimizing deterministic lattice automata
• Inherent vacuity in lattice automata
• Learning and characterizing fully-ordered lattice automata
• Lattice Automata
• Title not available (Why is that?)
• 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)