Tag: finite-automata

90 How to convert finite automata to regular expressions? 2012-05-23T08:19:27.003

33 Are there any non-finite automata? 2017-12-06T13:13:08.320

28 Why is a regular language called 'regular'? 2012-05-10T02:07:18.947

22 What are the conditions for a NFA for its equivalent DFA to be maximal in size? 2012-03-08T10:20:46.940

18 Is this language defined using twin primes regular? 2012-03-14T15:42:01.860

17 How to simulate backreferences, lookaheads, and lookbehinds in finite state automata? 2012-06-29T05:27:14.677

17 How do I write a proof using induction on the length of the input string? 2012-10-06T19:00:18.360

17 How to prove that DFAs from NFAs can have exponential number of states? 2012-09-15T21:10:09.980

17 Difference between a turing machine and a finite state machine? 2013-10-21T20:45:02.480

15 Languages accepted by modified versions of finite automata 2012-03-14T14:59:22.810

15 The number of different regular languages 2014-05-08T09:46:37.043

15 Can a language have more than one DFA? 2016-02-03T15:14:28.190

14 What are the possible sets of word lengths in a regular language? 2012-03-09T16:46:44.240

14 Brzozowski's algorithm for DFA minimization 2012-05-16T16:43:10.513

13 How to show that a "reversed" regular language is regular 2012-08-18T15:54:03.993

13 Can a Turing Machine decide if an NFA accepts a string of prime length? 2013-03-27T17:28:14.523

13 Exponential separation between NFAs and DFAs in the presence of unions 2013-07-27T11:42:51.633

13 How did the word "production" end up being a synonym with the word "rule" in the context of Computer Science? 2016-12-14T19:19:42.650

12 Why NFA is called Non-deterministic? 2017-09-06T12:52:17.370

11 How to convert an NFA with overlapping cycles into a regular expression? 2012-03-23T07:35:51.517

11 Can we say DFA is more efficient than NFA? 2013-02-01T14:42:41.990

11 Not able to convert from NFA to DFA 2013-02-14T22:56:54.687

11 What is the difference between finite automata and finite state machines? 2013-03-07T10:44:05.670

11 What is the complexity of the emptiness problem for 2-way DFAs? 2013-07-26T22:35:28.517

11 How fast can we decide whether a given DFA is minimal? 2014-03-02T12:41:01.930

11 Is it mandatory to define transitions on every possible alphabet in Deterministic Finite Automata? 2016-11-23T18:22:40.480

11 Monadic Second Order Logic for Dummies 2017-10-25T09:35:46.217

10 Optimal myopic maze solver 2012-06-02T16:18:06.140

10 Can an FSA count? 2013-04-09T07:58:38.200

10 Is there a way to test if two NFAs accept the same language? 2013-06-11T17:23:26.430

10 Why is NFA minimization a hard problem when DFA minimization is not? 2013-06-15T17:57:35.147

10 Regular language not accepted by DFA having at most three states 2014-02-19T22:05:01.387

10 Method for measuring the 'similarity' between FSA grammars? 2014-09-09T21:29:31.200

10 How do I verify that a DFA is equivalent to a NFA? 2015-12-09T06:03:17.730

10 Is the following extension of finite state automata studied? 2016-10-01T21:18:23.553

10 Why are Linearly Bounded Turing Machines more powerful than Finite State Automata? 2017-04-17T15:52:54.100

9 Words that have the same right- and left-associative product 2012-04-23T18:12:11.180

9 Difference between the languages accepted by two DFAs with different initial state/accepting states? 2013-03-24T03:40:45.747

9 Is the reversal of a minimal DFA also minimal? 2014-05-07T19:51:47.230

9 How to create DFA from regular expression without using NFA? 2015-03-27T10:41:18.870

9 What is the relationship between Turing Machines with a finite tape and Finite State Automata? 2015-03-31T16:16:58.087

9 Algorithms for minimizing Moore automata 2015-06-28T21:55:47.663

9 Is non-determinism in a non-deterministic turing machine different from that of finite automata and push down automata? 2015-10-13T15:14:34.813

9 DFA for accepting all binary strings of form power of $n$ (not divisible by $n$) i.e. $n^k$ for given $n$ 2016-01-22T14:25:58.077

9 Condition for infinitude of the language of a finite state automaton 2017-01-12T14:22:00.263

9 Is the equality of two DFAs a decidable problem? 2017-09-28T12:08:28.030

8 NFA with exponential number of states when deteminized 2012-08-31T19:54:57.733

8 Problem with implementing Brzozowski's algorithm 2012-10-17T22:23:04.570

8 Proving the language which consists of all strings in some language is the same length as some string in another language is regular 2012-11-05T05:52:51.367

8 Practical application of Finite State Machines 2013-03-05T03:25:55.350

8 In a DFA, does every state have a transition on every symbol of the alphabet? 2013-06-10T05:15:52.510

8 Algorithm to shrink a DFA by introducing nondeterminism? 2013-07-12T16:19:26.300

8 Partition an infinite regular language into 2 disjoint infinite regular languages 2013-12-04T14:40:00.883

8 Intersection of context free with regular languages 2013-12-05T14:24:39.063

8 Smallest DFA that accepts given strings and rejects other given strings 2014-01-13T09:37:38.647

8 Counting the number of words accepted by an acyclic NFA 2014-07-17T11:09:11.003

8 Minimize Deterministic Finite Automata with no accepting states 2015-05-01T02:12:51.423

8 Can an Earley Parser be made into a fuzzy parser similar to the Levenshtein Automata Algo for DFA? 2015-07-30T22:59:11.030

8 Why should we study all the three forms of representation of finite automata? 2016-02-27T19:50:48.160

8 Any problem solved by a finite automaton is in P 2017-04-12T05:03:55.970

8 Is square numbers written in binary a regular language? 2017-11-17T15:38:42.937

7 Connection between KMP prefix function and string matching automaton 2012-05-05T09:56:27.257

7 Is this intersection of DFAs correct? 2012-11-25T19:04:26.350

7 Classes of NFAs which allow efficient subset testing or unambiguity conversions 2013-05-06T22:26:42.443

7 What is a good algorithm for generating random DFAs? 2013-06-28T05:14:15.410

7 Automaton for substring matching 2013-07-01T10:48:25.027

7 Results on the languages recognized by undirected DFAs 2013-08-15T10:27:23.167

7 For what kinds of languages is min |NFA| = Ω(min |DFA|)? 2013-09-12T16:37:35.247

7 Counting Deterministic Finite Automata 2013-09-19T04:17:15.567

7 Smallest NFA accepting concatenations of two words of the length $k$ which are different at all positions 2014-07-16T11:58:50.193

7 How to XOR automata? 2014-11-12T08:58:44.107

7 How does an NFA use epsilon transitions? 2015-01-21T23:54:30.077

7 Is it possible to build DFA for odd-length words with 1 in the middle? 2016-05-03T11:07:43.560

7 Regular expressions and 'capturing parentheses' with 'backreferences' 2017-01-23T21:08:51.990

7 What is the Pumping Lemma a lemma to? 2017-02-07T21:11:06.663

7 What is the complexity for the universality problem for a NFA with all states accepting? 2017-02-10T11:39:17.143

7 Why does Non Determinism not enhance FA like it does for PDA 2017-03-07T23:50:38.097

7 Incorrect proof of closure under the star operation using NFA results in the NFA recognizing undesired strings? 2017-10-31T11:29:13.483

6 If $L$ is context-free and $R$ is regular, then $L / R$ is context-free? 2012-05-17T16:19:42.050

6 Prove that regular languages are closed under the cycle operator 2012-05-22T05:28:58.017

6 What piece am I missing to turn this idea into a programming language? 2012-09-19T19:58:45.397

6 Are there real lexers that use NFAs directly instead of first transforming them to DFAs? 2013-02-12T17:55:33.023

6 Make a tag system simulate a finite automaton? 2013-08-19T03:42:11.630

6 I need clarification about DFA's and DFA acceptable languages 2014-04-05T18:34:32.793

6 Convert DFA to Regular Expression 2014-07-18T12:18:57.640

6 Detecting palindromes in binary numbers using a finite state machine 2014-10-19T10:37:20.413

6 context free grammar to NFA 2014-12-17T01:57:03.210

6 How similar are two DFAs? -not just binary equivalence- 2016-04-20T10:03:32.530

6 What does Cellular Automata Pre-image problem actually means? 2016-04-20T20:29:45.373

6 Is there a language with non-isomorphic minimum-state UFAs? 2016-10-21T08:44:23.947

6 Should two DFAs be complete before making an intersection of them? 2016-10-24T08:25:51.310

6 Finite State Automata Within A Compiler 2017-07-24T16:37:59.277

6 Can we convert an NFA to a regular expression of polynomial length? 2017-11-16T13:14:59.430

5 A DFA for recognizing comments 2012-03-14T22:46:16.420

5 Is the set of codes of Deterministic Finite-State Automata a regular language? 2012-07-09T16:26:02.807

5 Building a finite state transducer 2012-07-14T19:48:07.230

5 Decidability of Machines 2009-12-06T15:47:36.283

5 Is the set of minimal DFA decidable? 2012-08-05T13:05:39.717

5 Prove that the language of non-prime numbers written in unary is not regular 2012-10-09T22:26:18.387