Filters








4,302 Hits in 7.5 sec

Datalog Automata Extended Abstract [chapter]

Bernard LANG
1988 Proceedings of the Third International Conference on Data and Knowledge Bases  
By extending to these automata a dynamic programming technique developed for PDAs in context-free parsing, we obtain a general and simple technique for constructing efficient polynomial query evaluators  ...  We propose a new computational paradigm for the evaluation of recursive Datalog queries, which is based on a pushdown automaton (PDA) model.  ...  extending the dynamic programming parsing techniques presented in [16] .  ... 
doi:10.1016/b978-1-4832-1313-2.50036-6 dblp:conf/jcdkb/Lang88 fatcat:cglmszdjbzdbxgxdvbui2pfjli

Page 952 of Mathematical Reviews Vol. 55, Issue 3 [page]

1978 Mathematical Reviews  
On line context free language recognition in less than cubic time (extended abstract). Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pa., 1976), pp. 112-120. Assoc. Comput.  ...  /log n) operations | on bit vectors of length n, or O(n°/log n) operations in a RAM. | This makes it the fastest known on-line context free language recognition algorithm.”  ... 

Page 594 of Mathematical Reviews Vol. 54, Issue 2 [page]

1977 Mathematical Reviews  
Ruzzo, On line context free language recognition in less than cubic time (extended abstract) (pp. 112-120); Amelia C, Fong and Jeffrey D. Ullman, Finding the depth of a flow graph (pp. 121-125); H.  ...  Sudborough, On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store (pp. 141-148); Wolfgang J. Paul, Robert Endre Tarjan and James R.  ... 

Simulation of Two-Way Pushdown Automata Revisited

Robert Glück
2013 Electronic Proceedings in Theoretical Computer Science  
The simulation is then extended to 2-way nondeterministic pushdown automata (2NPDA) to provide for a cubic-time recognition of context-free languages.  ...  The time required to run the final construction depends on the degree of nondeterminism. The key mechanism that enables the polynomial-time simulations is the sharing of computations by memoization.  ...  In the following we extend the simulator to recognize all context-free languages in cubic time. The method by Aho et al.  ... 
doi:10.4204/eptcs.129.15 fatcat:mtosvaxch5c3jbhzzzltqvb5qe

Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm [chapter]

Alexander Okhotin
2010 Lecture Notes in Computer Science  
The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer and System Sciences, 10:2 (1975), 308-314)  ...  Its time complexity on an input string of length n is O(BMM (n) log n), where BMM (n) is the number of operations needed to multiply two Boolean matrices of size n × n, which is O(n 2.376 ) as per the  ...  On the other hand, they can be implemented in a variety of efficient algorithms, including a straightforward cubic-time parser, as well as many practical parsing algorithms working much faster in special  ... 
doi:10.1007/978-3-642-14455-4_31 fatcat:5zpoj2qfdjg2jf3fwvegoilnma

Parsing by matrix multiplication generalized to Boolean grammars

Alexander Okhotin
2014 Theoretical Computer Science  
The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer and System Sciences, 10:2 (1975), 308-314)  ...  Its time complexity on an input string of length n is O(BMM (n) log n), where BMM (n) is the number of operations needed to multiply two Boolean matrices of size n × n, which is O(n 2.376 ) as per the  ...  On the other hand, they can be implemented in a variety of efficient algorithms, including a straightforward cubic-time parser, as well as many practical parsing algorithms working much faster in special  ... 
doi:10.1016/j.tcs.2013.09.011 fatcat:ipyddkufqnectcpv4wm5lm2plu

Subcubic algorithms for recursive state machines

Swarat Chaudhuri
2008 Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '08  
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in slightly subcubic time.  ...  The recognition problem for loop-free 2-PDAs reduces to reachability in acyclic RSMs-i.e., RSMs whose configuration graphs are cycle-free. Obviously, these are less general than bounded-stack RSMs.  ...  Note that context-free recognition is the special case of CFLreachability where S is a chain.  ... 
doi:10.1145/1328438.1328460 dblp:conf/popl/Chaudhuri08 fatcat:fb24zqeflngwnbzijjwpxxkv7i

Subcubic algorithms for recursive state machines

Swarat Chaudhuri
2008 SIGPLAN notices  
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in slightly subcubic time.  ...  The recognition problem for loop-free 2-PDAs reduces to reachability in acyclic RSMs-i.e., RSMs whose configuration graphs are cycle-free. Obviously, these are less general than bounded-stack RSMs.  ...  Note that context-free recognition is the special case of CFLreachability where S is a chain.  ... 
doi:10.1145/1328897.1328460 fatcat:maud3jc4kjgjddgbxtwacnwlr4

The representation of abstract words: Why emotion matters

Stavroula-Thaleia Kousta, Gabriella Vigliocco, David P. Vinson, Mark Andrews, Elena Del Campo
2011 Journal of experimental psychology. General  
space-time but their existence depends on human minds/language (Hale, 1988) .  ...  The representation of abstract word meanings: Why emotion matters Concrete entities exist in space-time and are independent of human minds/language; abstract entities, on the other hand, do not exist in  ...  Many thanks to Allan Paivio for a stimulating discussion on our results and on dual coding theory.  ... 
doi:10.1037/a0021446 pmid:21171803 fatcat:ffcuamr22zhr3dcktj2gbl2xum

In-vitro reconfigurability of native chemical automata, the inclusiveness of their hierarchy and their thermodynamics

Marta Dueñas-Díez, Juan Pérez-Mercader
2020 Scientific Reports  
The Turing machine uses the Belousov-Zhabotinsky (BZ) oscillatory reaction to recognize a representative Context-Sensitive Language (CSL), the 1-PDA uses a pH network to recognize a Context Free Language  ...  Computations can be viewed as language recognition problems where both languages and automata recognizing them form an inclusive hierarchy.  ...  The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.  ... 
doi:10.1038/s41598-020-63576-6 pmid:32321965 fatcat:fx53ejvbkzgxdjvg57ckfdxmga

Morbig: a static parser for POSIX shell

Yann Régis-Gianas, Nicolas Jeannerod, Ralf Treinen
2018 Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering - SLE 2018  
Token recognition cannot be specified by regular expressions, lexical analysis depends on the parsing context and the evaluation context, and the shell grammar given in the specification is ambiguous.  ...  Besides, the unorthodox design choices of the shell language fit badly in the usual specification languages used to describe other programming languages.  ...  However, the set of LR(1) languages is a strict subset of the set of context-free languages.  ... 
doi:10.1145/3276604.3276615 dblp:conf/sle/Regis-GianasJT18 fatcat:n6mgvlrakjeeta4mbtbv2u5vmi

An Improved Context-Free Recognizer

Susan L. Graham, Michael Harrison and Walter L. Ruzzo
1980 ACM Transactions on Programming Languages and Systems  
It is conceptually simple and allows a variety of efficient implementations, which are worked out in detail. Two versions are given which run in faster than cubic time.  ...  A new algorithm for recognizing and parsing arbitrary context-free languages is presented, and several new results are given on the computational complexity of these problems.  ...  In these situations, general context-free language recognition and parsing algorithms are used. In the present paper a new, general, context-free recognizer is presented.  ... 
doi:10.1145/357103.357112 fatcat:ap4pbgfqfjhr7jgfnqr63fmbsq

Abstracts of Current Computer Literature

1969 IEEE transactions on computers  
have generalized the usual studies of regular sets and context-free languages in this context.  ...  Consoles Statistical Model for Console Behavior in Multiuser Computers 6379 Context-Free Generalization of Context-Free Languages 6348 Control Control Networks in Restructurable Dig- ital Systems  ... 
doi:10.1109/t-c.1969.222537 fatcat:yogv2lr73be65iqipqwh3bmem4

Does Formal Complexity Reflect Cognitive Complexity? Investigating Aspects of the Chomsky Hierarchy in an Artificial Language Learning Study

Birgit Öttl, Gerhard Jäger, Barbara Kaup, Iris Berent
2015 PLoS ONE  
According to the Chomsky Hierarchy, nested dependencies (context-free) are less complex than cross-serial dependencies (mildly context-sensitive).  ...  This study extends previous findings in demonstrating learning effects for nested and cross-serial dependencies with more natural stimulus materials in a classical AGL paradigm after only one hour of exposure  ...  Even Swiss German-and other natural languages that have non-context-free features-is much less complex than the most complex context-sensitive languages.  ... 
doi:10.1371/journal.pone.0123059 pmid:25885790 pmcid:PMC4401728 fatcat:53dh4hanlbatdkb22ikpegmtz4

Abstracts of Current Computer Literature

1969 IEEE transactions on computers  
, Processes,,Sequential Machines, Time- Sharing Context-Free Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language 6900 Control Large Scale Integrated Circuit Accumu- lator Chip  ...  6936 -see also Design, Synthesis Real-Time -see On-Line Recognition Syntactic Filter Routine for Recognition of Symbol Strings 6937 -see also Characters Recursion; Recursive Implicit Treatment of Computational  ... 
doi:10.1109/t-c.1969.222770 fatcat:3u7q7ac3b5hx5fdffcemcrpsay
« Previous Showing results 1 — 15 out of 4,302 results