11 Answered Questions
[SOLVED] Can regular expressions be used to match nested patterns?
- 2008-09-25 14:17:40
- Richard Dorman
- 96020 View
- 215 Score
- 11 Answer
- Tags: regex nested finite-automata
19 Answered Questions
[SOLVED] Is there a typical state machine implementation pattern?
- 2008-09-25 13:08:33
- Benoit
- 104805 View
- 106 Score
- 19 Answer
- Tags: c design-patterns finite-automata
2 Answered Questions
[SOLVED] Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s
- 2013-07-02 07:56:12
- jyoti
- 31551 View
- 6 Score
- 2 Answer
- Tags: regular-language finite-automata computation-theory dfa
1 Answered Questions
[SOLVED] Example of Non-Linear, UnAmbiguous and Non-Deterministic CFL?
- 2012-10-30 16:10:39
- Grijesh Chauhan
- 3220 View
- 4 Score
- 1 Answer
- Tags: finite-automata automata computation-theory formal-languages chomsky-hierarchy
3 Answered Questions
[SOLVED] What is the language of this deterministic finite automata?
- 2011-09-26 04:38:48
- tehman
- 7964 View
- 5 Score
- 3 Answer
- Tags: grammar context-free-grammar finite-automata deterministic
4 Answered Questions
[SOLVED] How does "δ:Q×Σ→Q" read in the definition of a DFA (deterministic finite automaton)?
- 2013-02-14 07:51:29
- trusktr
- 2768 View
- 7 Score
- 4 Answer
- Tags: regular-language finite-automata dfa deterministic
8 Answered Questions
[SOLVED] Practical non-Turing-complete languages?
- 2008-11-24 20:27:35
- Kyle Cronin
- 11883 View
- 40 Score
- 8 Answer
- Tags: regex finite-automata turing-complete halting-problem
5 Answered Questions
[SOLVED] DFA vs NFA engines: What is the difference in their capabilities and limitations?
- 2010-10-20 13:38:26
- blunders
- 24795 View
- 33 Score
- 5 Answer
- Tags: regex finite-automata dfa nfa
5 Answered Questions
[SOLVED] Finiteness of Regular Language
- 2013-12-27 16:13:31
- Madhudeep Petwal
- 2061 View
- 2 Score
- 5 Answer
- Tags: regular-language finite-automata automata formal-languages automata-theory
2 Answered Questions
[SOLVED] How to use the intersection construction to form a DFA?
- 2011-10-15 20:41:25
- jfisk
- 28045 View
- 25 Score
- 2 Answer
- Tags: finite-automata
4 Answered Questions
[SOLVED] To make sure: Pumping lemma for infinite regular languages only?
- 2012-08-06 16:36:37
- Lars Knickrehm
- 3563 View
- 7 Score
- 4 Answer
- Tags: math finite-automata regular-language formal-languages pumping-lemma
9 Answered Questions
[SOLVED] To use goto or not?
- 2010-06-23 21:37:16
- Abhinav Upadhyay
- 3946 View
- 20 Score
- 9 Answer
- Tags: c parsing goto finite-automata
4 Answered Questions
[SOLVED] Graph drawing algorithms - I'm trying to render finite state automata
- 2009-02-06 00:50:31
- Sam Lee
- 6694 View
- 8 Score
- 4 Answer
- Tags: algorithm graph finite-automata
4 Answered Questions
[SOLVED] How are finite automata implemented in code?
- 2016-02-08 14:56:50
- user5899005
- 8751 View
- 11 Score
- 4 Answer
- Tags: python finite-automata automata dfa nfa
7 Answered Questions
[SOLVED] Does C# include finite state machines?
- 2009-09-10 18:40:43
- Maciek
- 29959 View
- 27 Score
- 7 Answer
- Tags: c# .net design-patterns finite-automata fsm
2 Answered Questions
[SOLVED] Testing intersection of two regular languages
- 2010-02-26 00:33:59
- Mike Samuel
- 1507 View
- 5 Score
- 2 Answer
- Tags: parsing finite-automata automata
5 Answered Questions
[SOLVED] How to find the intersection of two NFA
- 2014-02-09 16:58:01
- Aditya Nambiar
- 7797 View
- 4 Score
- 5 Answer
- Tags: algorithm intersection finite-automata dfa nfa
1 Answered Questions
[SOLVED] How to use Finite Automaton to implement a scanner
- 2017-10-18 09:58:33
- Max Koretskyi aka Wizard
- 199 View
- 1 Score
- 1 Answer
- Tags: compiler-construction lexical-analysis finite-automata
3 Answered Questions
[SOLVED] What is a finite state transducer?
- 2011-02-02 08:15:42
- user581734
- 18469 View
- 28 Score
- 3 Answer
- Tags: computer-science terminology finite-automata transducer
11 Answered Questions
[SOLVED] how useful is Turing completeness? are neural nets turing complete?
- 2010-06-07 14:20:05
- Albert
- 8043 View
- 46 Score
- 11 Answer
- Tags: neural-network finite-automata turing-complete state-machine
6 Answered Questions
[SOLVED] Levenshtein DFA in .NET
- 2010-10-20 11:18:39
- Miguel
- 1594 View
- 6 Score
- 6 Answer
- Tags: .net performance finite-automata automata levenshtein-distance
1 Answered Questions
[SOLVED] Tool for drawing automata and syntax trees
- 2010-11-06 16:00:46
- Julian Lettner
- 6592 View
- 1 Score
- 1 Answer
- Tags: windows finite-automata diagramming
8 Answered Questions
[SOLVED] What is the use of finite automata?
- 2009-10-03 20:17:29
- nicky
- 14442 View
- 8 Score
- 8 Answer
- Tags: theory finite-automata
2 Answered Questions
[SOLVED] How to perform FST (Finite State Transducer) composition
- 2010-04-15 22:40:27
- Tasbeer
- 5599 View
- 8 Score
- 2 Answer
- Tags: nlp finite-automata state-machine
5 Answered Questions
[SOLVED] Finite State Machine in Objective-C
- 2009-07-10 16:25:49
- Brock Woolf
- 6543 View
- 4 Score
- 5 Answer
- Tags: objective-c oop finite-automata
1 Answered Questions
[SOLVED] (FInite State Machine) - Implementing a XML schema validator in javascript
- 2010-08-05 20:06:50
- Casey Jordan
- 2273 View
- 5 Score
- 1 Answer
- Tags: javascript xml xsd finite-automata
2 Answered Questions
[SOLVED] Capture groups using DFA-based (linear-time) regular expressions: possible?
- 2015-03-09 11:55:57
- Mehrdad
- 546 View
- 5 Score
- 2 Answer
- Tags: regex finite-automata dfa
1 Answered Questions
[SOLVED] How to merge two finite state automata?
- 2012-06-26 06:13:03
- Aadit M Shah
- 6094 View
- 4 Score
- 1 Answer
- Tags: algorithm finite-automata state-machine deterministic
2 Answered Questions
[SOLVED] Split a string based on each time a Deterministic Finite Automata reaches a final state?
- 2010-12-16 15:05:34
- Alain
- 518 View
- 2 Score
- 2 Answer
- Tags: regex string split finite-automata deterministic
1 Answered Questions
[SOLVED] How do you construct the union of two DFA's?
- 2010-12-15 12:39:30
- Old McStopher
- 16230 View
- 8 Score
- 1 Answer
- Tags: union transition finite-automata dfa
