Geodesic
PDA with independent counters
Modelirovanie i analiz informacionnyh sistem, Tome 22 (2015) no. 2, pp. 176-196

Voir la notice de l'article provenant de la source Math-Net.Ru

Push-down automata with independent counters (PDACs) combine the power of PDAs and Petri Nets. They were developed in [21, 15], as a tool of recognition of languages generated by Categorial Dependency Grammars (CDGs). CDGs are classical categorial grammars extended by oriented polarized valencies. They express both projective and non-projective dependencies between the words of a sentence. PDAC is a usual PDA equipped with a finite number of counters. The independence of counters means that their state has no effect on the choice of an automaton move. In the first part of the paper we compare some variants of PDACs and prove the equivalence of two variants of PDAs with independent counters: without syntactic and without semantic $\varepsilon$-loops. Some connections between PDAC-languages and Petri Net languages are noticed. Then we show that PDACs are equivalent to stack+bag push-down automata (SBPA) independently introduced by Søgaard and that $\varepsilon$-acyclic SBPAs recognize exactly CDG-languages. Multimodal Categorial Dependency Grammars (mmCDGs) were introduced in [4] as an extension of GDGs that allows control of some intersections of dependencies. The class of mmCDG-languages is rich enough and has good closure properties, that it forms AFL. In the second part of the paper we extend PDACs and introduce push-down automata with stacks of independent counters (PDASC). PDASCs extend PDACs twofold: (i) each counter is a stack of integers and (ii) there is a restriction function which allows to diminish a head of a counter only if the heads of all dependent counters are zeros. Our main result says that these PDASCs accept exactly the class of mmCDG-languages. The article is published in the author's wording.
Keywords: formal grammars and languages, push-down automata with independent counters, projective and non-projective dependency, categorial dependency grammar, multimodal categorial dependency grammar, push-down automata with stacks of independent counters.
Mots-clés : automata 
@article{MAIS_2015_22_2_a2,
     author = {Michael Dekhtyar and Boris Karlov},
     title = {PDA with independent counters},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {176--196},
     publisher = {mathdoc},
     volume = {22},
     number = {2},
     year = {2015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2015_22_2_a2/}
}
TY  - JOUR
AU  - Michael Dekhtyar
AU  - Boris Karlov
TI  - PDA with independent counters
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2015
SP  - 176
EP  - 196
VL  - 22
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2015_22_2_a2/
LA  - en
ID  - MAIS_2015_22_2_a2
ER  - 
%0 Journal Article
%A Michael Dekhtyar
%A Boris Karlov
%T PDA with independent counters
%J Modelirovanie i analiz informacionnyh sistem
%D 2015
%P 176-196
%V 22
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2015_22_2_a2/
%G en
%F MAIS_2015_22_2_a2
Michael Dekhtyar; Boris Karlov. PDA with independent counters. Modelirovanie i analiz informacionnyh sistem, Tome 22 (2015) no. 2, pp. 176-196. http://geodesic.mathdoc.fr/item/MAIS_2015_22_2_a2/