CLOSURE PROPERTIES OF LANGUAGES RECOGNIZED BY STRICTLY k-EDGE FINITE STATE AUTOMATA

DOI10.17654/MS100030397zbMath1404.68071OpenAlexW2501624421MaRDI QIDQ2963140

Anuchit Jitpattanakul

Publication date: 10 February 2017

Published in: Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/9969.htm

zbMATH Keywords

closure propertiesformal language theorystrictly \(k\)-acceptable languagesstrictly \(k\)-edge finite-state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: CLOSURE PROPERTIES OF LANGUAGES RECOGNIZED BY STRICTLY k-EDGE FINITE STATE AUTOMATA