PDA with Independent Counters
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. T...
Main Authors: | Michael Dekhtyar, Boris Karlov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2015-04-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/239 |
Similar Items
-
Testing Timed Nondeterministic Finite State Machines with the Guaranteed Fault Coverage
by: Aleksandr S. Tvardovskii, et al.
Published: (2017-08-01) -
The Modeling of Counter Machines by Two-Head Finite Automata
by: E. V. Kuzmin, et al.
Published: (2015-03-01) -
The Modeling of Counter Machines by Two-Head Finite Automata
by: E. V. Kuzmin, et al.
Published: (2012-01-01) -
Using balm-ii for Deriving Cascade Parallel Composition of Timed Finite State Machines
by: M. L. Gromov, et al.
Published: (2016-12-01) -
MINIMIZATION LOGICAL FUNCTION BY METHOD TO ALTERNATIVE ADAPTATION
by: Y.O. CHERNYSHEV, et al.
Published: (2009-09-01)