ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA

DOI10.1142/S0129054107005078zbMath1202.68238OpenAlexW2086380781MaRDI QIDQ3065610

Bala Ravikumar, Nicolae Sântean

Publication date: 6 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

deterministic NFA simulationlookahead delegatorunambiguous NFA

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Predictable semiautomata

Cites Work

• On the equivalence, containment, and covering problems for the regular and context-free languages
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata

This page was built for publication: ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA