Minimization, Learning, and Conformance Testing of Boolean Programs

DOI10.1007/11817949_14zbMath1151.68484MaRDI 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

68Q32: Computational learning theory

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Limitations of lower bound methods for deterministic nested word automata, Nondeterministic state complexity of nested word automata, State Complexity of Nested Word Automata