StackOverflow Questions for Tag: formal-languages

Bob Dole

Reputation: 13

Ambiguous Regular Grammar?

grammarregular-languagecomputation-theoryformal-languages

Score: 1

Answers: 2

nic

Reputation: 115

How do you parse a Synchronous Context Free Grammar?

parsinggrammarcontext-free-grammarautomataformal-languages

Score: 1

Answers: 0

Shahin Ghasemi

Reputation: 1759

How to convert cfg to pda with 2 states?

context-free-grammarformal-languagescontext-free-language

Score: 1

Answers: 2

chaulap

Reputation: 449

How do I sum elements of a set in Z specification?

formal-languagesformal-methods

Score: 0

Answers: 0

devio

Reputation: 1169

Alloy does not find a solution (instance) for my specification

alloyformal-languagesformal-verificationformal-methods

Score: 1

Answers: 1

Elijah Williams

Reputation: 17

Regex with even instances of ab and ba

regexregular-languageautomataformal-languages

Score: 0

Answers: 1

Vladimir Panteleev

Reputation: 25187

Minimal DFA / regular expression from set of strings

regexalgorithmdfaformal-languages

Score: 3

Answers: 2

Daoist Paul

Reputation: 161

How to convert UML or HCI diagrams to LTSA format?

stateformal-languagestla+

Score: 0

Answers: 0

oWitness

Reputation: 1

Context-Free Grammer in Chomsky's Normal Form to Pushdown Automaton

context-free-grammarautomataformal-languagespushdown-automaton

Score: 0

Answers: 0

Edward Z. Yang

Reputation: 26742

Checking if two yacc grammars are equivalent

parsingcomplexity-theoryformal-languages

Score: 12

Answers: 1

Mark

Reputation: 31

Balanced parentheses and brackets, where a closing bracket also closes any outstanding open parentheses (up to the previous open bracket)

parsingcompiler-constructionformal-languages

Score: 1

Answers: 0

HEMANTH M

Reputation: 1

Understanding Unary PCP Reduction to a Matching Problem (UPCP)

algorithmcomplexity-theorycomputation-theoryturing-machinesformal-languages

Score: 0

Answers: 0

KM1234

Reputation: 29

Why is this statement of logical equivalence true? f ∨ g ∧ h ≡ (f ∨ g) ∧ (f ∨ h)

equivalentformal-languagesreasoningtruthtable

Score: -2

Answers: 1

Johan Falkenjack

Reputation: 199

Definition of "operator", and by extension "operand", in Python terminology

pythoncomputer-scienceterminologyformal-languagesoperands

Score: 0

Answers: 0

ZihaoZhang

Reputation: 21

how to solve the undetermined issue in a let-such-that expression in Dafny?

setdafnyformal-languagesformal-methods

Score: 1

Answers: 2

Flash-KIM142

Reputation: 39

Finding a regular grammar for the language L

regexautomataformal-languages

Score: 0

Answers: 1

Crea Teeth

Reputation: 33

Training difficulties on Transformer seq2seq task using pytorch

machine-learningpytorchnlptransformer-modelformal-languages

Score: 1

Answers: 1

Francesca Restante

Reputation: 63

Talend application scenarios: is it correct to have logical operators in the first term of GAV mapping?

mappingtalendlogical-operatorsformal-languagesdata-integration

Score: 1

Answers: 0

Luciano Robino

Reputation: 87

Grammars, parsers and infinite loops

parsinggrammarformal-languages

Score: 0

Answers: 1

Jerald James Capao

Reputation: 175

Is L = {a^n b^m | n>m} a regular or irregular language?

regular-languagedfaformal-languages

Score: 14

Answers: 2

PreviousPage 1Next

StackOverflow Questions for Tag: formal-languages

Ambiguous Regular Grammar?

How do you parse a Synchronous Context Free Grammar?

How to convert cfg to pda with 2 states?

How do I sum elements of a set in Z specification?

Alloy does not find a solution (instance) for my specification

Regex with even instances of ab and ba

Minimal DFA / regular expression from set of strings

How to convert UML or HCI diagrams to LTSA format?

Context-Free Grammer in Chomsky&#39;s Normal Form to Pushdown Automaton

Checking if two yacc grammars are equivalent

Balanced parentheses and brackets, where a closing bracket also closes any outstanding open parentheses (up to the previous open bracket)

Understanding Unary PCP Reduction to a Matching Problem (UPCP)

Why is this statement of logical equivalence true? f ∨ g ∧ h ≡ (f ∨ g) ∧ (f ∨ h)

Definition of &quot;operator&quot;, and by extension &quot;operand&quot;, in Python terminology

how to solve the undetermined issue in a let-such-that expression in Dafny?

Finding a regular grammar for the language L

Training difficulties on Transformer seq2seq task using pytorch

Talend application scenarios: is it correct to have logical operators in the first term of GAV mapping?

Grammars, parsers and infinite loops

Is L = {a^n b^m | n&gt;m} a regular or irregular language?

Context-Free Grammer in Chomsky's Normal Form to Pushdown Automaton

Definition of "operator", and by extension "operand", in Python terminology

Is L = {a^n b^m | n>m} a regular or irregular language?