Minimization, Learning, and Conformance Testing of Boolean Programs

DOI10.1007/11817949_14zbMath1151.68484OpenAlexW1516541943MaRDI QIDQ5756620

P. Madhusudan, Mahesh Viswanathan, Viraj Kumar

Publication date: 4 September 2007

Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2142/11210

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Unnamed Item ⋮ Never-stop context-free learning ⋮ Learning and characterizing fully-ordered lattice automata ⋮ From languages to behaviors and back ⋮ Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Limitations of lower bound methods for deterministic nested word automata ⋮ Nondeterministic state complexity of nested word automata ⋮ State Complexity of Nested Word Automata

This page was built for publication: Minimization, Learning, and Conformance Testing of Boolean Programs