On the complexity of realization of finite languages by formulas

DOI10.1515/DMA.2000.10.2.159zbMath0966.68101OpenAlexW2078280653MaRDI QIDQ4522866

E. V. Orlova

Publication date: 4 January 2001

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

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

zbMATH Keywords

finite languagesregular expressions over finite alphabets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: On the complexity of realization of finite languages by formulas