We examine visibly counter languages, which are languages recognized by visibly counter automata (a.k.a. input driven counter automata). We are able to effectively characterize the visibly counter languages in AC^0 and show that they are contained in FO[+]
We study the computational and descriptional complexity of the following transformation: Given a one...
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL)...
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL)...
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by ...
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input ...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input ...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...
The original publication is available at www.springerlink.com.International audienceWhile visibly pu...
International audienceWhile visibly pushdown languages properly generalise regular languages and are...
D. Vermeir and W. Savitch (Fund. Inform. 4 (1981), 401–418) introduced two measures of nondeterminis...
The operator precedence languages (OPLs) represent the largest known subclass of the context-free la...
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL)...
We study the computational and descriptional complexity of the following transformation: Given a one...
We study the computational and descriptional complexity of the following transformation: Given a one...
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL)...
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL)...
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by ...
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input ...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input ...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...
The original publication is available at www.springerlink.com.International audienceWhile visibly pu...
International audienceWhile visibly pushdown languages properly generalise regular languages and are...
D. Vermeir and W. Savitch (Fund. Inform. 4 (1981), 401–418) introduced two measures of nondeterminis...
The operator precedence languages (OPLs) represent the largest known subclass of the context-free la...
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL)...
We study the computational and descriptional complexity of the following transformation: Given a one...
We study the computational and descriptional complexity of the following transformation: Given a one...
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL)...
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL)...
DOI
Add to ORKG