Computer Sciences > GATE 2023 > Theory of Computation
Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions:
Which one of the following Non-deterministic Finite-state Automata with e-transitions accepts the set of valid identifiers? (A double-circle denotes a final state)
A
B
C
D

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science