Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with finite-automata
Search options not deleted
user 42673
Questions about finite automata, an elementary automaton model with finite memory. It is equivalent to regular languages and the basis for many more complex models.
2
votes
2
answers
2k
views
p constant in pumping lemma for regular languages
We have a language
$L = \{ a^{n^{2}}, n < 12\}$ We have to find minimum constant P for pumping lemma.
What does p represent here? I thought p in pumping lemma represent number of states , yet the r …
- 179
1
vote
2
answers
2k
views
A context-free grammar for a language of strings with occurrence properties?
Creating a context-free grammar for the language
$L_1 = \{ 0^{n} 1 ^{m} \mid m,n \in \mathbb{N} \wedge m \equiv n \mod 3\}$
is quite easy. A grammar is
$$ S \rightarrow \epsilon \mid 0A $$
$$ …
- 179
0
votes
0
answers
35
views
Regular language is generated by clear grammar
Given a regular language , how could we prove that it is alsways ( or can be always ) generated by clear grammar ( such as that for every sentence exists only one derivation tree ).
Could we prove it …
- 179