MATH
Login Or Sign up

List Question

15
87
Views

Describing all formal theory theorems problem

Published on
#logic #formal-languages #formal-systems
275
Views

Construct an NFA wherein the first symbol of only appears once

Published on
#formal-languages #automata #regular-language
346
Views

For any given alphabet $\Sigma$, find the language $L$ that satisfies $L = (\Sigma L)^C$

Published on
#elementary-set-theory #logic #computer-science #first-order-logic #formal-languages
1.1k
Views

Context free grammar for palindrome over ALL terminals?

Published on
#formal-languages #context-free-grammar #formal-grammar
51
Views

I need help to solve this pumping lemma

Published on
#computer-science #formal-languages #regular-language
913
Views

How to prove that if the language L is regular , then K is also regular

Published on
#computer-science #formal-languages #automata #regular-language
26
Views

Form of strings in $\{a^nb^n | n \geq 0 \}^*$ vis-a-vis $(a^nb^n)^*$

Published on
#formal-languages #automata #context-free-grammar
187
Views

How to draw the reverse automaton for this language to show that L is regular.

Published on
#computer-science #formal-languages #automata #regular-language
1.5k
Views

Can a DFA (Deterministic Finite State Machine) have 1 loop for multiple inputs?

Published on
#discrete-mathematics #formal-languages #automata #regular-language
176
Views

Giving example for context-free grammar

Published on
#formal-languages #context-free-grammar
52
Views

Generating function for parenthesized expressions

Published on
#generating-functions #formal-languages #catalan-numbers
38
Views

Proving $K^*N \cup N = K^*N$

Published on
#discrete-mathematics #solution-verification #formal-languages #regular-language
340
Views

Convert Context Free Grammar to pushdown automata

Published on
#formal-languages #automata #context-free-grammar #pushdown-automata
887
Views

Can the pumping length ever be equal to $0$ ? (Pumping lemma for regular languages)

Published on
#discrete-mathematics #formal-languages #automata #regular-language #pumping-lemma
281
Views

How would you design a PDA to recognize the language of binary strings that end with a different symbol than they start with?

Published on
#discrete-mathematics #formal-languages #automata #context-free-grammar

Trending Questions

Popular # Hahtags

second-order-logic numerical-methods puzzle logic probability number-theory winding-number real-analysis integration calculus complex-analysis sequences-and-series proof-writing set-theory functions homotopy-theory elementary-number-theory ordinary-differential-equations circles derivatives game-theory definite-integrals elementary-set-theory limits multivariable-calculus geometry algebraic-number-theory proof-verification partial-derivative algebra-precalculus

Popular Questions

Copyright © 2021 JogjaFile Inc.