On Insertion Grammars with Maximum Parallel Derivation

Authors:
Liviu P. Dinu
Affiliations:
(Correspd.) University of Bucharest, Faculty of Mathematics and Computer Science, Centre for Computational Linguistics, Academiei 14, 010014, Bucharest, Romania. ldinu@funinf.cs.unibuc.ro
Venue:
Fundamenta Informaticae
Year:
2009

Citing 9
Cited 0

Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Natural computation for natural language

Fundamenta Informaticae
Marcus Contextual Grammars

Marcus Contextual Grammars
Handbook of Formal Languages

Handbook of Formal Languages
Characterizations of RE Languages by Means of Insertion Grammars

Characterizations of RE Languages by Means of Insertion Grammars
One-level phonology: autosegmental representations and rules as finite automata

Computational Linguistics
Contextual grammars as generative models of natural languages

Computational Linguistics
Context-free insertion-deletion systems

Theoretical Computer Science - Descriptional complexity of formal systems
A parallel approach to syllabification

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Theorem 3.7 of [1] is corrected. Two coherence principles and the ultrafilter property for partial functions contained in a relation are formulated. The equivalence of the coherent principles with AC and the equivalence of the ultrafilter property with ...