Never Minimal Automata and the Rainbow Bipartite Subgraph Problem

DOI10.1007/978-3-642-22321-1_32zbMath1221.68143MaRDI QIDQ5199981

Emanuele Rodaro, Pedro V. Silva

Publication date: 29 July 2011

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_32

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

05C15: Coloring of graphs and hypergraphs

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

Related Items

A graph theoretic approach to automata minimality, Extremal minimality conditions on automata