formal-languages

formal-languages

Is there a way to create a type 3 grammar for this language?

Is a subset of a context free language decidable?

Pushdown automata to accept the following language

Z notation: How to write operation schema that may add one or more tuples to a relation

How to represent sequential operation schemas [Z-notation]

Prove language is not context-free using pumping lemma

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

Prove that the language is context free

Formal Language Npda graph

Cleaner way to represent languages accepted by DFAs?

What characteristic of the language grammar defines that it will be interpreted or compiled?

Formalise the following requirement in propositional logic using suitable propositions for the component statements

Z into Isabelle

Language generated by a Context Free Grammar?

P is undecidable and not semidecidable, Q is undecidable and semidecidable and P ⊂ Q

Can Anyone help me with Computer theory?

Mildly Context sensitive Grammars

Formal Methods (Z-notation) - adding a new multiple relation

Example of a language, that isn't recursively enumerable and its complementary language also isn't RE

What would be the language generated by Σ*-x? [closed]

Context-sensitive grammar

Downloading Z specification for mac

Does this DFA have a solution?

Find a non-deterministic CFL whose reverse is deterministic

what is the length of a language that contains epsilon?

Production rules for a grammar

Recursive languages vs context-sensitive languages

page:1 of 1 main page

Categories

aws-global-accelerator

google-api-js-client

hough-transform

intel-media-sdk

load-data-infile

dimensional-modeling

uiviewanimation

android-architecture-c...

xcode-ui-testing

watson-discovery

monad-transformers

google-cloud-automl-nl

default-constructor

foreign-key-relationship

asp.net-membership

short-circuiting

shared-directory

ruby-on-rails-3.1

kendo-validator

boost-preprocessor

Resources