Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Novotný, Miroslav
Affiliations: Faculty of Computer Science, Masaryk University, Botanická 68a, 602 00 Brno, Czech Republic
Abstract: A construction is described assigning a pure grammar G_{mrn} to any language and to any integers 0≤m≤r≤n. This construction has the following property: If the sequence (G_{mrn})_{n≥r} has a limit G_{mr} for any r≥m and if the sequence (G_{mr})_{r≥m} has a limit, then the given language is generated by a pure grammar. By a limit of a sequence (a_{k})_{k≥k_{0}} we understand a member a_{k_{1}} of the sequence such that k_{1}≥k_{0} and a_{k}=a_{k_{1}} for any k≥k_{1}.
Keywords: generalized pure grammar, pure grammar, relation of domination, reducing operator
Journal: Fundamenta Informaticae, vol. 52, no. 4, pp. 345-360, 2002
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]