Book, R., S. Even, S. Greibach, and G. Ott: 1971, `Ambiguity in Graphs and Expressions'. IEEE Transactions on Computers 20(2), 149--153. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Algebraic Approach to Signal Flow Graph Theory - Pliam (1992) (Correct)
....embark to formulate an expression for the gain of a signal flow graph which is contingent upon the existence of certain inverses in the ring. The method of reduction, called the return loop method, is quite old. It was first worked out for matrices by Mason and his graduate students (cf. Lorens book [LOR] but no proof of its validity appears in the literature. A proof exists for matrix signal flow graphs in [RIE71] according to [R L] The resulting gain formula will be called Riegle s formula. The extension to rings in theorem 1 is adapted from [PLI86] cf. PLI89] Much of the ....
....in the noncommutative case as well, i.e. if each cycle product is in the Jacobson radical of the ring then the signal flow graph is reducible. The following proposition concerning interleaved products will prove extremely useful. It is the key to our main theorem, aside from the combinatorial bookkeeping of the previous chapter. Proposition 4 Let R be a ring. Let fA i g n i=0 ae R, and fS i g n i=1 ae Jac(R) If n Y i=0 A i 2 Jac(R) then A 0 n Y i=1 (1 Gamma S i ) Gamma1 A i 2 Jac(R) Proof: Each S i 2 Jac(R) means there are fT i g n i=1 ae R such that (1 Gamma S i ) 1 ....
[Article contains additional citation context not shown here]
R. Book, S. Even, S. Greibach, G. Ott, "Ambiguity in Graphs and Expressions," IEEE Trans. Comp. , vol. C-20, 1971.
Reasoning about XML Schema Languages using Formal Language.. - Lee, Mani, Murata (2000) (9 citations) (Correct)
....RJ# 10197, Log# 95071 November 16, 2000 Abstract A mathematical framework using formal language theory to describe and compare XML schema languages is presented. Our framework uses the work in two related areas regular tree languages [CDG 97] and ambiguity in regular expressions [BEGO71, BKW98] Using these work as well as the content in two classical references [HU79, AU79] we present the following results: 1) a normal form representation for regular tree grammars, 2) a framework of marked regular expressions and model groups, and their ambiguities, 3) five subclasses of ....
....to every hedge in a regular hedge language to make it a regular tree language. In other words, if L(H) is a regular hedge language, then f hwi j w 2 L(H)g is a regular tree language, where is a special symbol denoting the root of the tree. Ambiguity in regular expressions is described in [BEGO71] Here, the authors give several results relevant to our paper: 1) every regular language has a corresponding unambiguous regular expression, 2) we can construct an automaton called Glushkov automaton in [BKW98] corresponding to a given regular expression that preserves the ambiguities, and (3) ....
[Article contains additional citation context not shown here]
R. Book, S. Even, S. Greibach, and G. Ott. "Ambiguity in Graphs and Expressions". IEEE Transactions on Computers, 20(2):149--153, Feb. 1971.
Translating Regular Expressions into Small epsilon-Free.. - Hromkovic, Seibert.. (1997) (1 citation) (Correct)
....regular expressions may lead to a considerable increase of the descriptional complexity, i.e. there are regular languages requiring regular expressions of size exponential in the size of their minimal NFAs. On the other hand, previously described conversions from regular expressions into NFAs [RS59,BEGO71,HU79] produce automata whose size is in the worst case quadratic in the size of the input. In [SS88] 1 it is even claimed that for each n the regular language defined by (a 1 ) a 2 ) a n ) requires NFAs of size Omega (n 2 ) which would imply that the above conversions are optimal. ....
....(n log n) for the above mentioned example from [SS88] This also implies the nonexistence of linear size conversions from regular expressions to NFAs. The starting point of our construction is what we call the position automaton for a regular expression; this automaton, first described in [BEGO71] and also known as nondeterministic Glushkov automaton [Bru93] is based on ideas already explained in [MY60] and [Glu61] The basic idea of our construction is as follows. Each state of the position automaton for a given regular expression is split up into a small number of new states in a ....
[Article contains additional citation context not shown here]
Ronald Book, Shimon Even, Sheila Greibach, and Gene Ott. Ambiguity in graphs and expressions. IEEE Trans. Comput., C-20(2):149--153, 1971.
Mobility Patterns - Cedric Du Mouza (Correct)
No context found.
Book, R., S. Even, S. Greibach, and G. Ott: 1971, `Ambiguity in Graphs and Expressions'. IEEE Transactions on Computers 20(2), 149--153.
Mobility Patterns - Cedric Du Mouza (2005) (Correct)
No context found.
Book, R., S. Even, S. Greibach, and G. Ott: 1971, `Ambiguity in Graphs and Expressions'. IEEE Transactions on Computers 20(2), 149--153.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC