Minimizing deterministic lattice automata

DOI10.1145/2631915MaRDI QIDQ5892175zbMATH OpenOpenAlexWikidataFDO

Authors Shulamit Halamish, Orna Kupferman

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2631915

zbMATH Keywords

deterministic finite automatalattice automatalattice languagesminimization

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Recommendations

• Minimizing deterministic lattice automata
• Approximating deterministic lattice automata
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• Lattice Minimal Automata and Lattice Reduced Automata
• Minimizing Deterministic Weighted Tree Automata

Cites work

• Handbook of weighted automata
• scientific article; zbMATH DE number 1670794 (Why is no real title available?)
• scientific article; zbMATH DE number 5141500 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1744958 (Why is no real title available?)
• scientific article; zbMATH DE number 2102712 (Why is no real title available?)
• Lattice Automata
• Latticed simulation relations and games
• Linear Automaton Transformations
• Minimization of fuzzy finite automata
• Minimization of lattice automata
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• On model checking multiple hybrid views
• Ranking Automata and Games for Prioritized Requirements
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE

Cited in

(11)

• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• Inherent vacuity in lattice automata
• EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
• Approximating deterministic lattice automata
• Minimizing GFG Transition-Based Automata
• Minimization and canonization of GFG transition-based automata
• Minimizing deterministic lattice automata
• Minimization of automata for liveness languages
• Learning and characterizing fully-ordered lattice automata
• Approximate state reduction of fuzzy finite automata
• Polynomial crisp-minimization algorithm for fuzzy deterministic automata

This page was built for publication: Minimizing deterministic lattice automata

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