An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections

DOI10.1007/BF01091543MaRDI QIDQ1256319zbMATH OpenOpenAlexFDO

Authors Dang-Huy-Ruan, G. S. Tsejtin

Publication date 1977

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01091543

zbMATH Keywords

Boolean FunctionFinite AutomataFinite-State ComplexityGenerating SchemesMultigraphRegular Set

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

This page was built for publication: An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections

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