Combinatory automaton
Abstract
Recommendations
Combinatory Categorial Grammars: generative power and relationship to Linear Context-Free Rewriting Systems
ACL '88: Proceedings of the 26th annual meeting on Association for Computational LinguisticsRecent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammars, Head Grammars, and Linear Indexed Grammars. In this paper ...
Mean-payoff automaton expressions
CONCUR'10: Proceedings of the 21st international conference on Concurrency theoryQuantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition ...
The tree-generative capacity of combinatory categorial grammars
AbstractThe generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is investigated. It is demonstrated that the tree languages generated by CCGs can also be generated by simple monadic context-free tree ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 80Total Downloads
- Downloads (Last 12 months)42
- Downloads (Last 6 weeks)6
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in