On the existence of lookahead delegators for nfa

DOI10.1142/S0129054107005078zbMATH Open1202.68238OpenAlexW2086380781MaRDI QIDQ3065610FDOQ3065610

Authors: B. Ravikumar, N. 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

Recommendations

• Deterministic Simulation of a NFA with k–Symbol Lookahead
• Decidability results on the existence of lookahead delegators for NFA
• On composition and lookahead delegation of \(e\)-services modeled by automata
• Algorithms and Computation
• \((k,l)\)-unambiguity and quasi-deterministic structures: an alternative for the determinization

zbMATH Keywords

deterministic NFA simulationlookahead delegatorunambiguous NFA

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

Cited In (5)

• On composition and lookahead delegation of \(e\)-services modeled by automata
• Decidability results on the existence of lookahead delegators for NFA
• Deterministic Simulation of a NFA with k–Symbol Lookahead
• Algorithms and Computation
• Predictable semiautomata

This page was built for publication: On the existence of lookahead delegators for nfa

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