Algorithm that checks if a context free grammar generates infinite language that a DFA rejects -


i have dfa , cfg g, have check if g generates infinite words don't accept (rejected a), , nice complexity time.

i thought construct graph cfg , if contains directed cycle, produces infinite language. vertices variables , each production draw edges. input words rejected dfa , when found cycle can cfg generates infinite language rejected dfa a.

i don't know how transform in algorithm or if proposal not correct , have create new one.

edit: can transform cfg cnf , dfa ( chomsky ).after, try find cycle. transformed dfa can have less states dfa a... need how words rejected dfa in cfg think.

given cfg g, construct pda b. given dfa , pda b, construct pda c such c accepts l(c) = l(b) \ l(a), \ set difference. now, l(c) precisely language of words accepted pda b (hence generated cfg g) not accepted, i.e. rejected, dfa a.

now, question whether language of b infinite. can this. 1 way convert pda cfg, , put cfg in cnf - removing unnecessary , unproductive symbols. then, create dependency tree among nonterminal symbols. if remaining (productive) nonterminal symbol depends upon itself, i.e., there loop, language infinite. otherwise, language finite (empty, if there no productive symbols remaining).


Comments

Post a Comment

Popular posts from this blog

commonjs - How to write a typescript definition file for a node module that exports a function? -

consider, toml node module can use: // toml.d.ts declare module toml { export function parse(value:string):any; } declare module "toml" { export = toml; } then: /// <reference path="../../../../../defs/toml/toml.d.ts"/> import toml = require('toml'); toml.parse(...); however, node module export single function, such 'glob' ( https://github.com/isaacs/node-glob ). the node usage of module be: var glob = require("glob") glob("*.js", {}, callback(err, files) { ... }); you'd naively expect this: // glob.d.ts declare function globs(paths:string, options:any, callback:{(err:any, files:string[]):void; ...but because typescripts 'import' semantics bit strange, seems can use 'import .. = require()' statement alias modules . trying call: /// <reference path="../../../../../defs/glob/glob.d.ts"/> import blog = require('glob'); results in: error ts2072: mod
Read more

openid - Okta: Failed to get authorization code through API call -

i'm integrating okta own idp server using okta's api. i'm implementing authorization code flow following steps below: in own server, use /api/v1/authn endpoint sessiontoken. use sessiontoken obtain authorization calling endpoint: /oauth2/v1/authorize?client_id=" + clientid + "&sessiontoken=" + sessiontoken + "&response_type=code&response_mode=query&scope=openid&redirect_uri=" + redirecturl + "&state=evanyang&nonce=" it's supposed return response status code 302 , location header containing redirect url code value. however, keep getting response status code 200 , without location header, html body saying "you using unsupported browser." , "javascript disabled on browser." according api documentation: http://developer.okta.com/docs/api/resources/oidc.html#authentication-request , sessiontoken parameter sufficient this: an okta one-time sessiontoken. allows api-based
Read more

thorough guide for profiling racket code -

did googling ("racket profiling", "racket measure performance"), didn't find , there no examples in docs. did google "profile" search on htdp - no luck. (profile (f ...)) output isn't obvious other small snippets. ideally want python's python -m cprofile usage examples. when search "python profiling", both duckduckgo , google give top result: 26.4. python profilers . (although scanned quickly, seems more of reference "thorough usage guide" examples. if had else in mind, perhaps please link that?) the equivalent racket documentation be: profile: statistical profiler . a usage example: #lang racket (require profile) (profile-thunk (thunk (function-to-profile arg0 arg1) )) here (thunk e) convenience (lambda () e) . bigger example: #lang racket (module mod racket (provide f) (define (f) (for/list ([i 10000]) i))) (require (prefix-in mod: 'mod)) (define (f) (for ([i 10000
Read more