Modelirovanie i Analiz Informatsionnykh Sistem
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Modelirovanie i Analiz Informatsionnykh Sistem, 2015, Volume 22, Number 2, Pages 176–196 (Mi mais434)  

PDA with independent counters

Michael Dekhtyar, Boris Karlov

Dept. of Computer Science, Tver State University, Zhelyabova str., 33, Tver, Russia, 170000
References:
Abstract: 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: automata, 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.
Received: 15.02.2015
Bibliographic databases:
Document Type: Article
UDC: 519.766:519.713.1
Language: English
Citation: Michael Dekhtyar, Boris Karlov, “PDA with independent counters”, Model. Anal. Inform. Sist., 22:2 (2015), 176–196
Citation in format AMSBIB
\Bibitem{DekKar15}
\by Michael~Dekhtyar, Boris~Karlov
\paper PDA with independent counters
\jour Model. Anal. Inform. Sist.
\yr 2015
\vol 22
\issue 2
\pages 176--196
\mathnet{http://mi.mathnet.ru/mais434}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3417820}
\elib{https://elibrary.ru/item.asp?id=23405826}
Linking options:
  • https://www.mathnet.ru/eng/mais434
  • https://www.mathnet.ru/eng/mais/v22/i2/p176
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Моделирование и анализ информационных систем
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024