Results 1 to 10 of about 237 (86)

The Ontology for Parasite Lifecycle (OPL): towards a consistent vocabulary of lifecycle stages in parasitic organisms. [PDF]

J Biomed Semantics, 2012
BACKGROUND: Genome sequencing of many eukaryotic pathogens and the volume of data available on public resources have created a clear requirement for a consistent vocabulary to describe the range of developmental forms of parasites. Consistent labeling of
Berriman, Matthew, Carrington, Mark, Logan-Klumpler, Flora, Louis, Christos, Parikh, Priti P, Protasio, Anna V, Sahoo, Satya S, Sheth, Amit P, Stoeckert, Christian J, Topalis, Pantelis, Zheng, Jie   +10 more
core   +5 more sources

On Parikh slender context-free languages

Theoretical Computer Science, 2001
In a recent paper we defined and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications.
Juha Honkala
exaly   +3 more sources

On Parikh Slender Languages and Power Series

Journal of Computer and System Sciences, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juha Honkala
exaly   +2 more sources

A decision method for Parikh slenderness of context-free languages

Discrete Applied Mathematics, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juha Honkala
exaly   +3 more sources

Unboundedness Problems for Machines with Reversal-Bounded Counters [PDF]

, 2023
We consider a general class of decision problems concerning formal languages, called (one-dimensional) unboundedness predicates, for automata that feature reversal-bounded counters (RBCA).
Flavio D'Alessandro, Georg Zetzsche, Ian McQuillan, Lia Schütze, Moses Ganardi, Oscar Ibarra, Pascal Baumann   +6 more
core   +5 more sources

New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages [PDF]

, 2022
International audienceThis article extends the work of Flajolet [Philippe Flajolet, 1987] on the relation between generating series and inherent ambiguity.
Koechlin, Florent
core   +2 more sources

On Bounded Linear Codes and the Commutative Equivalence [PDF]

, 2021
The problem of the commutative equivalence of semigroups generated by semi-linear languages is studied. In particular conditions ensuring that the Kleene closure of a bounded semi-linear code is commutatively equivalent to a regular language are ...
CARPI ARTURO, D'ALESSANDRO FLAVIO
core   +1 more source

On the Commutative Equivalence of Context-Free Languages [PDF]

, 2018
The problem of the commutative equivalence of context-free and regular languages is studied. In particular conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are ...
A Luca de, A Restivo, F D’Alessandro, F D’Alessandro, F D’Alessandro, F D’Alessandro, F D’Alessandro, G Baron, J Berstel, JM Boë, L Ilie, M Latteux, M-P Béal, MR Bridson, N Chomsky, OH Ibarra, OH Ibarra, P Flajolet, PW Shor, R Incitti, S Ginsburg, S Ginsburg   +21 more
core   +1 more source

On the Commutative Equivalence of Algebraic Formal Series and Languages [PDF]

, 2021
The problem of the commutative equivalence of context-free and regular languages is studied. Conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are ...
Carpi, Arturo, D'Alessandro Flavio
core   +1 more source

On counting functions and slenderness of languages

, 2019
We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$.
Ibarra, Oscar H., McQuillan, Ian, Ravikumar, Bala   +2 more
core   +1 more source