A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Design and Implementation of the Symbol Table for Object-Oriented Programming Language
2017
International Journal of Database Theory and Application
Preserved Fulltext
design an abstract syntax tree and a symbol table structure considering the characteristics of the language. ...
This structure increases the source code complexity of modules that generate symbols and modules that reference symbol tables, and when designing a compiler for a new language, it is necessary to newly ...
Improved abstract syntax trees make it easy to add properties without modifying existing tree structures when Copyright ⓒ 2017 SERSC creating a tree for a language of the same object-oriented language. ...
doi:10.14257/ijdta.2017.10.7.03
fatcat:jmjhg3f2tfdihd747tuzzgtzqa
Inference of Reversible Tree Languages
2004
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We also study the tree language classes in relation to other well known ones, and some properties of these languages are proven. ...
In this paper, we study the notion of -reversibility and -testability when regular tree languages are involved. ...
We also define the class of -testable tree languages as the extension to tree-like structures of the well-known notion in string languages. This class is also studied in relation to other classes. ...
doi:10.1109/tsmcb.2004.827190
pmid:15462433
fatcat:i6rgs5bpbnfnncsn6xsbgmitf4
Page 1171 of Mathematical Reviews Vol. , Issue 84c
[page]
1984
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
trees and systolic language recognition by tree automata. ...
1171 68F Linguistics
characterization of these two classes of trees in terms of their generators 2 ,2),°°*,g, is given and the connection between (Zo.815" **»8,)-trees and unary OL systems is mentioned ...
On the Typology of Inflection Class Systems
2006
Folia linguistica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Thus strongly infl ecting languages have the most complex vertical and horizontal stratifi cation of hierarchical tree structures. ...
Infl ectional classes are a property of the ideal infl ecting-fusional language type. ...
Its tree structure is very shallow and of little complexity, quite different from the structures of infl ecting-fusional languages, see trees 7a-b (Nom. Sg., Acc. Sg., Poss. Sg.). ...
doi:10.1515/flin.40.1-2.51
fatcat:mfkyducrpncgxnkxj66daxrply
On the Typology of Inflection Class Systems
2006
Folia linguistica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Thus strongly infl ecting languages have the most complex vertical and horizontal stratifi cation of hierarchical tree structures. ...
Infl ectional classes are a property of the ideal infl ecting-fusional language type. ...
Its tree structure is very shallow and of little complexity, quite different from the structures of infl ecting-fusional languages, see trees 7a-b (Nom. Sg., Acc. Sg., Poss. Sg.). ...
doi:10.1515/flin.40.1part2.51
fatcat:p6izpzty7rahfnrsl4ogfsgzyi
Splicing on tree-like structures
1999
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show that splicing systems on trees with finite sets of axioms and finite sets of rules can generate the class of context-free languages without the need of imposing multiplicity constraints. ...
Trees are a common and useful data structure in computer science and have a biological counterpart such as molecular sequences with secondary structures, which are typical structures in RNA sequences. ...
JSPS-RFTF 96100101 from the Japan Society for the Promotion of Science. We would like to thank anonymous referees for their valuable comments which improved the paper very much. ...
doi:10.1016/s0304-3975(98)00087-5
fatcat:4rgpmftcnvcq5n4fm5755dkwx4
A Model-Theoretic Framework for Theories of Syntax
[article]
1996
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
purely in terms of the properties of the class of structures they license. ...
By focusing on the structural properties of languages rather than on mechanisms for generating or checking structures that exhibit those properties, this model-theoretic approach can offer simpler and ...
The key virtue of descriptive complexity results like the characterizations of language-theoretic complexity classes discussed here and the more typical characterizations of computational complexity classes ...
arXiv:cmp-lg/9604023v1
fatcat:cy2yo7dqazawrkb5ye57gqcn3a
Restricting grammatical complexity
2004
Cognitive Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Theories of natural language syntax often characterize grammatical knowledge as a form of abstract computation. ...
This paper argues that such a characterization is correct, and that fundamental properties of grammar can and should be understood in terms of restrictions on the complexity of possible grammatical computation ...
Acknowledgments It is a great pleasure to dedicate this paper to Aravind Joshi, whose work and whose humanity have been and continue to be a source of inspiration. ...
doi:10.1207/s15516709cog2805_3
fatcat:kwszhtsm4nh43is5uv725selxa
Restricting grammatical complexity
2004
Cognitive Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Theories of natural language syntax often characterize grammatical knowledge as a form of abstract computation. ...
This paper argues that such a characterization is correct, and that fundamental properties of grammar can and should be understood in terms of restrictions on the complexity of possible grammatical computation ...
Acknowledgments It is a great pleasure to dedicate this paper to Aravind Joshi, whose work and whose humanity have been and continue to be a source of inspiration. ...
doi:10.1016/j.cogsci.2004.03.006
fatcat:qttly5tgqrfqlllqhnokaqol4e
A model-theoretic framework for theories of syntax
1996
Proceedings of the 34th annual meeting on Association for Computational Linguistics -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
purely in terms of the properties of the class of structures they license. ...
By focusing on the structural properties of languages rather than on mechanisms for generating or checking structures that exhibit those properties, this model-theoretic approach can offer simpler and ...
The key virtue of descriptive complexity results like the characterizations of language-theoretic complexity classes discussed here and the more typical characterizations of computational complexity classes ...
doi:10.3115/981863.981865
dblp:conf/acl/Rogers96
fatcat:b5pbdo4krjfaxfxsmwt4kokzhu
Approach to Manage Complexity in Internet of Things
2014
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
More generally, the lack of structural complexity of the tree model limits the understanding of complex systems of systems (SoS). ...
As we have just seen , complexity concepts as time and space , can be modeled with limitations by OWL, a tree structured language , but we begin to perceive the first order logic language fit better. ...
doi:10.1016/j.procs.2014.09.081
fatcat:fjtjrskqdvfjbp7nnjx3ctnjiq
On Descriptive Complexity, Language Complexity, and GB
[article]
1995
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
This provides a flexible approach to establishing language-theoretic complexity results for formalisms that are based on systems of well-formedness constraints on trees. ...
We introduce L^2_K,P, a monadic second-order language for reasoning about trees which characterizes the strongly Context-Free Languages in the sense that a set of finite trees is definable in L^2_K,P iff ...
language complexity classes. ...
arXiv:cmp-lg/9505041v1
fatcat:bhnblfnjzbfylgkwoc35d6xgju
Page 3364 of Mathematical Reviews Vol. , Issue 84h
[page]
1984
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Then ¥ has the property that, when applied to
some structurally comparable languages, it produces a language of
intermediary structural complexity. ...
We use the operation V to build
a context-free language which is of structural complexity greater than
any finite-turn language but is not a context-free generator.” ...
Page 10262 of Mathematical Reviews Vol. , Issue 2004m
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We prove upper bounds for combinatorial parame- ters of finite relational structures, related to the complexity of learning a definable set. ...
We prove that the classes of regular w-languages (those recognized by Biichi automata) and of deterministic @- languages (those recognized by deterministic Biichi automata) are not identifiable in the ...
Page 5006 of Mathematical Reviews Vol. , Issue 96h
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The main results of the paper establish relationships between the classes of languages accepted by restricted IPSs and the classes MA and NP. ...
If C and D are complexity classes such that C is closed with respect to a special kind of reducibility, D admits a C-class representation, and D* admits a complete language for all oracles X, then the ...
« Previous
Showing results 1 — 15 out of 241,057 results