On solutions to systems of automata-type functional equations

zbMATH Open1324.03001MaRDI QIDQ5263784FDOQ5263784

S. S. Marchenkov

Publication date: 17 July 2015

Full work available at URL: http://mathnet.ru/eng/da700

Recommendations

• On solving automaton equations
• On the complexity of the satisfiability problem for a system of functional Boolean equations
• On complexity of problem of satisfiability for systems of countable-valued functional equations
• scientific article; zbMATH DE number 2101001
• On the automata functional systems

zbMATH Keywords

satisfiability problemautomata-type functional equation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cited In (6)

• Synthesis of reliable circuits in the basis consisting of the Webb function in \(P_k\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the edge-independence number and edge-covering number for regular graphs
• Asymptotically optimal in reliability circuits in two bases under failures of \(0\) \((k-1)\) type at the outputs of elements
• On solving automaton equations

This page was built for publication: On solutions to systems of automata-type functional equations

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