The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Finite-automaton aperiodicity is PSPACE-complete
Theoretical Computer Science
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Regular expression star-freeness is PSPACE-complete
Acta Cybernetica
Alternating finite automata and star-free languages
Theoretical Computer Science
Finite-State Language Processing
Finite-State Language Processing
Varieties Of Formal Languages
Part of Speech Tagging from a Logical Point of View
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Compiling and using finite-state syntactic rules
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Regular Expressions and Predicate Logic in Finite-State Language Processing
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Finite-state methods and models in natural language processing
Natural Language Engineering
Compiling simple context restrictions with nondeterministic automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
Syntactic constraints in Koskenniemi's Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, complement and concatenation. This is an essential improvement to the descriptive complexity of ENGFSIG. The result opens a door for further analysis of logical properties and possible optimizations in the FSIG descriptions. The proof contains a new formula for compiling Koskenniemi's restriction operation without any marker symbols.