Controlled grammatic ambiguity
ACM Transactions on Programming Languages and Systems (TOPLAS)
Error repair with validation in LR-based parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Recognition of Abstract Regions in Cartographic Maps
COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Thompson Digraphs: A Characterization
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
A Basis for Looping Extensions to Discriminating-Reverse Parsing
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
On Excusable and Inexcusable Failures
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Journal of Computer and System Sciences
On predictive parsing and extended context-free grammars
Computer Science in Perspective
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
Theoretical Computer Science
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
A characterization of Thompson digraphs
Discrete Applied Mathematics
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
Left-to-right parsing and bilexical context-free grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Review of "Generalized LR parsing" by Masaru Tomita. Kluwer Academic Publishers 1991.
Computational Linguistics - Special issue on inheritance: II
Recognition of linear context-free rewriting systems
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
ACM SIGPLAN Notices
The language intersection problem for non-recursive context-free grammars
Information and Computation
Towards efficient implementation of XML schema content models
Proceedings of the 2004 ACM symposium on Document engineering
Producing the left parse during bottom-up parsing
Information Processing Letters
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A Memory-efficient ε-Removal Algorithm for Weighted Acyclic Finite-State Automata
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Science of Computer Programming
On LR(k)-parsers of polynomial size
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Tracking down the origins of ambiguity in context-free grammars
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Algorithmic aspects of natural language processing
Algorithms and theory of computation handbook
P-hardness of the emptiness problem for visibly pushdown languages
Information Processing Letters
Checking determinism of XML Schema content models in optimal time
Information Systems
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar
Computational Linguistics
Prefix probability for probabilistic synchronous context-free grammars
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Vibes: A visual language for specifying behavioral requirements of algorithms
Journal of Visual Languages and Computing
| Hi-index | 0.00 |