Newbetuts
.
New posts in automata
Regular expression for a language string
automata
regular-language
regular-expressions
Does there exist a universal pushdown automaton?
computability
formal-languages
automata
Find the DFA for the language $L = \{a^nb: n \geq 0\} \cup \{b^na : n \geq 1\}$
computer-science
automata
Proof that an automaton stops
automata
Why is it undecidable whether two finite-state transducers are equivalent?
computer-science
computability
automata
Automata | Prove that if $L$ is regular than $half(L)$ is regular too
automata
regular-language
regular-expressions
Can a regular grammar be ambiguous?
automata
regular-language
context-free-grammar
If $L$ is regular, prove that $\sqrt{L}=\left\{ w : ww\in L\right\}$ is regular
formal-languages
automata
regular-language
Design DFA accepting binary strings divisible by a number 'n'
regex
automata
dfa
How to write a regular expression for the given language?
automata
regular-expressions
Write a regular expression over the given language. [closed]
automata
regular-expressions
Finite automaton that recognizes the empty language $\emptyset$
computer-science
formal-languages
automata
Intersection of two deterministic finite automata?
computer-science
automata
formal-languages
regular-language
Interesting behavior of the $2$-tag system $\{a\rightarrow abc,b\rightarrow ab,c\rightarrow c\}$
automata
computational-mathematics
Is it possible for a computer to "learn" a regular expression by user-provided examples?
regex
artificial-intelligence
theory
automata
Regular vs Context Free Grammars
context-free-grammar
regular-language
automata
Finding Context Free Grammar for a language
automata
context-free-grammar
pushdown-automata
Eilenberg's rational hierarchy of nonrational automata & languages
automata
formal-languages
semigroups
context-free-grammar
The complement of a language of a machine L(M)
computer-science
formal-languages
automata
regular expression for strings - infinite case [closed]
discrete-mathematics
automata
regular-expressions
Prev
Next