StackOverflow Questions for Tag: jflap

sangonm

Reputation: 11

Turing Machine that outputs the number of a's and b's in binary representation

binaryautomataturing-machinesautomatonjflap

Score: 1

Answers: 1

keegen1

Reputation: 1

Easy JFLAP turing machine

jflap

Score: 0

Answers: 0

atharva g

Reputation: 1

I am using JFLA .In mealy I want to accept alphabet except letter 's' . in finite automat I can write [a-z[^s]] but this line is not working for melay

jflap

Score: 0

Answers: 0

Henrik Eronen

Reputation: 1

How can I represent the regular language ∑={a,b,c} with a regular expression in such a way that two characters 'b' cannot be next to each other?

regexregex-groupregular-languagejflap

Score: 0

Answers: 2

perrywinkle

Reputation: 383

jflap duplicating states or transitions

turing-machinesjflap

Score: 1

Answers: 0

Samuel

Reputation: 511

Let the user place Buttons in Java

javaswingjbuttonjflap

Score: 2

Answers: 1

Aboumouadine

Reputation: 23

Why does JFlap fail to build a usable LL(1) parser from my calculator grammar?

grammarll-grammarjflap

Score: 1

Answers: 1

Dusan Biga

Reputation: 63

Non-deterministic finite automata

algorithmlanguage-agnosticstate-machinejflap

Score: 0

Answers: 1

O. Villarreal

Reputation: 11

Deterministic Finite Automata on JFLAP

finite-automatadfajflap

Score: 0

Answers: 1

Viktor

Reputation: 59

Let Σ = { a; b} How can I define a PDA in JFLAP which recognizes the following?

formal-languagesautomatonpushdown-automatonjflap

Score: 0

Answers: 1

Austin Amon

Reputation: 15

Simulating Non Deterministic Turing machine with Deterministic Turing machine [JFLAP]

computation-theoryturing-machinesdeterministicnon-deterministicjflap

Score: 0

Answers: 1

meightythree

Reputation: 333

Find the pushdown automata of this language L={A^i B^j C^k | 2k <= i <= 3k OR j != (i+k) } with one stack

pushdown-automatonjflap

Score: 1

Answers: 1

DjVasu

Reputation: 113

Does jflap support (+) operator in a regular expression?

finite-automatadfajflap

Score: 1

Answers: 0

NeoR

Reputation: 353

PushDown Automaton (PDA) for L={a^(n)b^(n)c^(n)|n>=1}

computationpushdown-automatonautomata-theoryjflap

Score: 1

Answers: 2

deibbs

Reputation: 24

The way to use JFLAP to do a Pushdown Automaton

pushdown-automatonautomatonjflap

Score: 0

Answers: 1

Hopeless Noob

Reputation: 63

Correct Unrestricted Grammar for:

parsinggrammarjflap

Score: 0

Answers: 1

RAL

Reputation: 897

JFLAP Turing Machine shortcut issue

turing-machinesjflap

Score: 0

Answers: 1

andandandand

Reputation: 22270

Where can I find sample automata and turing machines?

turing-machinesautomatajflap

Score: 0

Answers: 2

k r

Reputation: 409

Trying to use a jflap regex in scala

regexscalajflap

Score: 1

Answers: 1

ehsun7b

Reputation: 4866

Regular Expression for IP validation which works in JFLAP

javaregexipautomatajflap

Score: 1

Answers: 1

PreviousPage 1Next

StackOverflow Questions for Tag: jflap

Turing Machine that outputs the number of a&#39;s and b&#39;s in binary representation

Easy JFLAP turing machine

I am using JFLA .In mealy I want to accept alphabet except letter &#39;s&#39; . in finite automat I can write [a-z[^s]] but this line is not working for melay

How can I represent the regular language ∑={a,b,c} with a regular expression in such a way that two characters &#39;b&#39; cannot be next to each other?

jflap duplicating states or transitions

Let the user place Buttons in Java

Why does JFlap fail to build a usable LL(1) parser from my calculator grammar?

Non-deterministic finite automata

Deterministic Finite Automata on JFLAP

Let Σ = { a; b} How can I define a PDA in JFLAP which recognizes the following?

Simulating Non Deterministic Turing machine with Deterministic Turing machine [JFLAP]

Find the pushdown automata of this language L={A^i B^j C^k | 2k &lt;= i &lt;= 3k OR j != (i+k) } with one stack

Does jflap support (+) operator in a regular expression?

PushDown Automaton (PDA) for L={a^(n)b^(n)c^(n)|n&gt;=1}

The way to use JFLAP to do a Pushdown Automaton

Correct Unrestricted Grammar for:

JFLAP Turing Machine shortcut issue

Where can I find sample automata and turing machines?

Trying to use a jflap regex in scala

Regular Expression for IP validation which works in JFLAP

Turing Machine that outputs the number of a's and b's in binary representation

I am using JFLA .In mealy I want to accept alphabet except letter 's' . in finite automat I can write [a-z[^s]] but this line is not working for melay

How can I represent the regular language ∑={a,b,c} with a regular expression in such a way that two characters 'b' cannot be next to each other?

Find the pushdown automata of this language L={A^i B^j C^k | 2k <= i <= 3k OR j != (i+k) } with one stack

PushDown Automaton (PDA) for L={a^(n)b^(n)c^(n)|n>=1}