Question

for language L={a^n b^m c^l d^k | n==l,m==k} is correct or not?

score 174 · Answer 1 · 2026-03-25 23:38:34

174

Views

for language L={a^n b^m c^l d^k | n==l,m==k} is correct or not?

Published on 25 Mar 2026 - 23:38

score 62 · Answer 2 · 2020-06-07 09:36:57

62

Views

How many language families are there?

Published on 07 Jun 2020 - 9:36

score 113 · Answer 3 · 2020-06-07 14:55:46

113

Views

How many recursive language families are there?

Published on 07 Jun 2020 - 14:55

score 32 · Answer 4 · 2026-03-26 04:51:12

32

Views

Is this automaton correct for this regular laguage?

Published on 26 Mar 2026 - 4:51

score 833 · Answer 5 · 2020-06-10 22:00:44

833

Views

How to convert Finite Automaton (FA) to Non-Deterministic FA (NFA) with fewer states?

Published on 10 Jun 2020 - 22:00

score 581 · Answer 6 · 2020-06-11 16:20:04

581

Views

How to convert DFA to NFA with fewer states and build TG from DFA with two states?

Published on 11 Jun 2020 - 16:20

score 160 · Answer 7 · 2026-03-26 13:47:59

160

Views

When the tape head of a TM is scanning a blank symbol, what will happen?

Published on 26 Mar 2026 - 13:47

score 306 · Answer 8 · 2026-03-22 16:00:29

306

Views

What are the relations between pushdown automata and parsers?

Published on 22 Mar 2026 - 16:00

score 396 · Answer 9 · 2026-03-26 13:40:57

396

Views

What is the relation between recursive languages and partial recursive functions?

Published on 26 Mar 2026 - 13:40

score 60 · Answer 10 · 2020-06-19 20:45:50

60

Views

Is there a commonly used notion of regular language outside of finite order types and $\omega$?

Published on 19 Jun 2020 - 20:45

score 79 · Answer 11 · 2020-06-24 12:09:03

79

Views

Does the family of languages outputted by finite automata exactly form some type of languages in Chomsky hierarchy?

Published on 24 Jun 2020 - 12:09

score 90 · Answer 12 · 2020-06-24 12:14:26

90

Views

Do stringology, combinatorics on word, and automatic sequences cover the same topic?

Published on 24 Jun 2020 - 12:14

score 89 · Answer 13 · 2026-03-26 06:30:07

89

Views

Can DFA's be directly constructed from some special regular expressions but not from general regular expressions?

Published on 26 Mar 2026 - 6:30

score 125 · Answer 14 · 2020-06-27 11:46:37

125

Views

Notation for the union between the finite input alphabet and the empty string. What is the standard notation?

Published on 27 Jun 2020 - 11:46

score 466 · Answer 15 · 2020-06-28 12:29:12

466

Views

Is a right invariant equivalent relation necessarily $_$ for some finite automaton $$?

Published on 28 Jun 2020 - 12:29

List Question

for language L={a^n b^m c^l d^k | n==l,m==k} is correct or not?

How many language families are there?

How many recursive language families are there?

Is this automaton correct for this regular laguage?

How to convert Finite Automaton (FA) to Non-Deterministic FA (NFA) with fewer states?

How to convert DFA to NFA with fewer states and build TG from DFA with two states?

When the tape head of a TM is scanning a blank symbol, what will happen?

What are the relations between pushdown automata and parsers?

What is the relation between recursive languages and partial recursive functions?

Is there a commonly used notion of regular language outside of finite order types and $\omega$?

Does the family of languages outputted by finite automata exactly form some type of languages in Chomsky hierarchy?

Do stringology, combinatorics on word, and automatic sequences cover the same topic?

Can DFA's be directly constructed from some special regular expressions but not from general regular expressions?

Notation for the union between the finite input alphabet and the empty string. What is the standard notation?

Is a right invariant equivalent relation necessarily $_$ for some finite automaton $$?

Trending Questions

Popular # Hahtags

Popular Questions