Proceedings ArticleDOI
Developments in language theory ii: at the crossroads of mathematics, computer science and biology
Jürgen Dassow,Grzegorz Rozenberg,Arto Salomaa +2 more
- pp 1-491
TLDR
Towards robustness in parsing - fuzzifying context-free language recognition the computational complexity of PCGS with regular components prefix and periodic languages of rational w-languages Cantor sets and Dejean's conjecture.Abstract:
Towards robustness in parsing - fuzzifying context-free language recognition the computational complexity of PCGS with regular components prefix and periodic languages of rational w-languages Cantor sets and Dejean's conjecture recent developments in trace theory trace language definable with modular quantifiers finite state recognizability for two-dimensional languages - a brief survey on emptiness and counting for alternating finite automata descriptional and computational complexity measure for distributive generation of languages nondeterminism degrees of context-free languages the membership problem for unordered vector languages transforming a single-valued transducer into a mealy machine.read more
Citations
More filters
Book ChapterDOI
Descriptional and Computational Complexity of Finite Automata
Markus Holzer,Martin Kutrib +1 more
TL;DR: This paper tours a fragment of a vast literature documenting the importance of deterministic, nondeterministic, and alternating finite automata as an enormously valuable concept and discusses developments relevant to finite Automata related problems like, for example, simulation of and by several types of infinite automata.
Journal ArticleDOI
Algebraic aspects of families of fuzzy languages
TL;DR: In this article, the concept of full abstract family of fuzzy languages or full AFFL was introduced, which is the fuzzy counterpart of the notion of fuzzy abstract families of languages that has been encountered frequently in investigating families of crisp (i.e., non-fuzzy) languages.
Journal ArticleDOI
Fuzzy context-free languages: part 2: Recognition and parsing algorithms
TL;DR: Asveld et al. as discussed by the authors used fuzzy context-free grammars in order to model grammatical errors resulting in erroneous inputs for robust recognizing and parsing algorithms for fuzzy context free languages.
Journal ArticleDOI
Equational axiomatizability for coalgebra
TL;DR: A characterization result shows that a class of coalgebras is definable by equations if and only if it is closed under coproducts, quotients, sources of morphisms and representative inclusions.
Journal ArticleDOI
Fuzzy context-free languages: part 1: Generalized fuzzy context-free grammars
TL;DR: In this article, generalized fuzzy context-free K-grammars have been proposed to describe correctly as well as erroneously derived sentences by a single generating mechanism, where the situation of making a finite choice out of an infinity of possible grammatical errors during each contextfree derivation step is modeled.