On the edge-independence number and edge-covering number for regular graphs

DOI10.1515/DMA.1992.2.1.1zbMATH Open0804.68095OpenAlexW2089257943MaRDI QIDQ4318599

A. S. Podkolzin, Š. Ušymlič

Publication date: 5 January 1995

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1992.2.1.1

zbMATH Keywords

synthesis of automataautomata equations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On rational solution of the state equation of a finite automaton 👍 👎
• On complete systems of automata 👍 👎
• Solving automaton equations with distortions in the automaton transition function 👍 👎
• Progressive solutions to a parallel automata equation 👍 👎
• Progressive Solutions to a Parallel Automata Equation 👍 👎
• On solving automaton equations 👍 👎
• New types of automata to solve fixed point problems 👍 👎

This page was built for publication: On the edge-independence number and edge-covering number for regular graphs

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