2 edition of **polynomial algorithm for deciding bisimularity of normed context-free processes** found in the catalog.

polynomial algorithm for deciding bisimularity of normed context-free processes

Yoram Hirshfeld

- 165 Want to read
- 22 Currently reading

Published
**1994**
by LFCS, Dept. of Computer Science, University of Edinburgh in Edinburgh
.

Written in English

- Equivalence (Linguistics),
- Algorithms.,
- Polynomials.

**Edition Notes**

Includes bibliographical references.

Statement | Yoram Hirshfeld, Mark Jerrum, Faron Moller. |

Series | LFCS reportseries -- ECS-LFCS-94-286 |

Contributions | Jerrum, Mark., Moller, Faron., University of Edinburgh. Laboratory forFoundations of Computer Science. |

The Physical Object | |
---|---|

Pagination | 27 p. ; |

Number of Pages | 27 |

ID Numbers | |

Open Library | OL19162258M |

You might also like

Myth and literature

Myth and literature

Amphiboles

Amphiboles

Life after death

Life after death

Wolfensberger, Wolfersberger family

Wolfensberger, Wolfersberger family

graveyard monuments in Enderby parish churchyard

graveyard monuments in Enderby parish churchyard

wells of tears

wells of tears

compleat imbiber 5

compleat imbiber 5

Worcester County register of wills

Worcester County register of wills

Janes high-speed marine craft.

Janes high-speed marine craft.

user manual for PASCALPLUS

user manual for PASCALPLUS

Celebrate 100

Celebrate 100

Baptist source book

Baptist source book

Guildhall Library findings

Guildhall Library findings

Long-term trends in tax revenues of OECD member countries, 1955-1980.

Long-term trends in tax revenues of OECD member countries, 1955-1980.

The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (), who put the problem in Σ 2 P = NP NP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in this paper we improve on this result by describing a Cited by: A polynomial algorithm for deciding bisimularity of normed context-free processes (LFCS report series) [Yoram Hirshfeld] on *FREE* shipping on qualifying : Yoram Hirshfeld.

context-free grammars is undecidable [ 10, Theorem Here we show for the first time that bisimulation equivalence of normed context-free processes is decidable in polynomial time (Theorem ). For comparison, the best complexity bound previously known was due to Huynh and Tian [l 11, who showed that.

Buy A polynomial algorithm for deciding bisimularity of normed context-free processes (LFCS report series) by Yoram Hirshfeld (ISBN:) from Amazon's Book Store. Everyday low Author: Yoram Hirshfeld.

A polynomial algorithm for the regularity problem of weak and branching bisimilarity on totally normed process algebra (PA) processes is given.

Its time complexity is $$\\mathcal{O}(n^3 + mn)$$, where n is the number of transition rules and m is the maximal length of the rules. The algorithm works for totally normed basic process algebra (BPA) as well as basic parallel process (BPP).Author: Fei Yang, Hao Huang.

A Polynomial Time Algorithm for Checking Regularity of Totally Normed Process Algebra: YANG Fei*(), HUANG Hao (ƺ) (Laboratory of Basic Studies in Computing Science, Department of Computer Science and Engineering, Shanghai Jiaotong University, ShanghaiChina). An algorithm whose worst case time complexity depends on numeric value of input (not number of inputs) is called Pseudo-polynomial algorithm.

For example, consider the problem of counting frequencies of all elements in an array of positive numbers. A pseudo-polynomial time solution for this is to first find the maximum value, then iterate from /5.

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Full text of "Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars" See other formats.

Non-deterministic Polynomial Time Decidable Problem - Intro to Algorithms How to remove useless productions from Context Free Grammar (CFG) - Duration: Quick Sort Algorithm. The Garey and Johnson book (Computers and Intractibility: A Guide to the Theory of NP-Completeness, ) has a detailed explanation of this, early on.I can't recommend it enough.

There are several reasons why problems are considered "tractable" if they have polynomial algorithms, but the most important is this: Suppose you have a computer and with it you can feasibly calculate solutions to.

polynomial-time algorithm has been proposed for general context-free grammars or even for regular grammars. Let G be a context-free grammar generating the language L=L(G)˜7*, and let n be a positive integer. The n-slice of L is the subset L&7n containing all words in L of length n.

The problem of exactly determining the size of the n-slice of L(G). the polynomial-time algorithm for context-free language recognition (i.e., the CYK algorithm or dynamic programming), ll out the table for string w = abba and CFG G: S.

RT R. TR ja T. TR jb Answer: We start the CYK algorithm by writing an empty n n table, where n = 4 is the length of the string w = abba that we want to determine if File Size: KB. the polynomial time algorithm for context free language recognition, for the string w = baba and the CFG G: S!RT R!TR ja T!TR jb 2.

Show that NP is closed under union and concatenation. A boolean formula is in conjunctive normal form (called a cnf-formula) if it comprises several clauses ^-ed together, and each clause is a sequence. Thus, our result implies that the polynomial time learning problem of simple deterministic languages via membership and equivalence queries is solvable if and only if we can ï¬ nd a representative sample in polynomial time via these queries.

We show the learnability of simple deterministic languages by giving a learning by: 8. Abstract. We investigate the local testability problem of deterministic finite automata.

A locally testable language is a language with the property that for some positive integer k, whether or not a word w is in the language depends on (1) the prefix and suffix of w of length k, and (2) the set of intermediate substrings of w of length k+1, without regard to the order in which these Cited by: Fowler () introduced the bounded-order Lambek Calculus and provided a polynomial time algorithm for its sequent derivability.

How-ever, this result is limited because it requires exponential time in the presence of lexical ambiguity.

That is, Fowler () did not provide a polynomial time parsing algorithm. The purpose of this paper will be to. Reference for problems without efficient algorithm (in polynomial time) Ask Question Asked 6 years, 3 months ago.

Thanks for contributing an answer to Mathematics Stack Exchange. Proving that a language is regular and context-free.

A C B E F S D G Figure 1: The dependency graph of context-free grammar G1. For each string s ∈ L(GA), there exists at least one parse tree that yields s and in which the root of the parse tree is labelled with th of a parse tree τ is the length of a longest path (number of edges) from the root to a leafandis denoted by d(τ).Note thatwe do notrestrictthe grammarinCited by: 4.

polynomial time and space. A typical idea to deal with the first point is to say that an algorithm performs well if it identifies in the limit the correct language. The second point has led to debate about how to define polynomial time: the main definitions of polynomial inference have been proposed by Pitt and Angluin.

We return in this paper. A polynomial algorithm for deciding bisimularity of normed context-free processes LFCS report series: : Yoram Hirshfeld: Libros en idiomas extranjerosFormat: Encuadernación desconocida,