Minimizing Deterministic Lattice Automata

DOI10.1145/2631915zbMath1354.68156MaRDI QIDQ5892175

Orna Kupferman, Shulamit Halamish

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 automata; minimization; lattice automata; lattice languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)