ON THE REGULARITY OF SETS OF MULTI-ACCEPTED STRINGS OF A NON-DETERMINISTIC FINITE AUTOMATON

DOI10.1142/S1793557109000595zbMath1194.68149OpenAlexW2043096789MaRDI QIDQ5189972

J. K. Grieshop, L. K. Waters

Publication date: 11 March 2010

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557109000595

zbMATH Keywords

semigroupsnondeterministic finite automataregular languageS

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Automata Theory with Modern Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ON THE REGULARITY OF SETS OF MULTI-ACCEPTED STRINGS OF A NON-DETERMINISTIC FINITE AUTOMATON