Filters








26 Hits in 5.1 sec

Page 5896 of Mathematical Reviews Vol. , Issue 87j [page]

1987 Mathematical Reviews  
These languages are closely related to two-dimensional pattern matchings, and thus suited for studying them formally.  ...  Summary: “We propose two new classes of two-dimensional ar- ray languages, called existential matching languages (EXMLs) and universal matching languages (UNMLs).  ... 

Subject index volumes 1–200

1999 Theoretical Computer Science  
two-dimensional additive cellular automata, 3032 two-dimensional alternating finite automata, 2393, 2696 Turing machines, 537, 1256, 1269 two-dimensional categories, 6 12, 6 I5 cellular automaton  ...  , 2392 nondeterministic cellular automaton, 2393 objects, 25 I7 on-line tessellation acceptors, 497 packing problem, 3484 two-dimensional pattern matching, 497 by two-dimensional on-line tessellation  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage [article]

Joost Engelfriet, Heiko Vogler
2020 arXiv   pre-print
We consider sequential automata with MSO graph storage and associate with each such automaton a string language (in the usual way) and a graph language; a graph is accepted by the automaton if it represents  ...  Thus, the iterated pushdown storage types are MSO-expressible.  ...  (ix) In [MP11] this idea is successfully applied to an alternative definition of GL(A) for various restrictions of multi-pushdown and multi-queue automata.  ... 
arXiv:1905.00559v4 fatcat:rt7kachzinaoflud6xmmsry3bu

A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage

Joost Engelfriet, Heiko Vogler
2019 Discrete Mathematics & Theoretical Computer Science  
We consider sequential automata with MSO graph storage and associate with each such automaton a string language (in the usual way) and a graph language; a graph is accepted by the automaton if it represents  ...  Thus, the iterated pushdown storage types are MSO-expressible.  ...  (ix) In [MP11] this idea is successfully applied to an alternative definition of GL(A) for various restrictions of multi-pushdown and multi-queue automata.  ... 
doi:10.23638/dmtcs-22-4-3 fatcat:6rqd6xf4efbl7g5h6kk7pshptm

Abstracts of Current Computer Literature

1969 IEEE transactions on computers  
; Turing Machines Complexities of Realization of Boolean Functions by Automata and Turing Machines 6665 Languages Recognizable by Counter and Turing Machines 6672 Recognizability of an Origin-Crossing  ...  Languages Recognizable by Counter and Turing Machines-see 6672.  ... 
doi:10.1109/t-c.1969.222696 fatcat:yhhpsujxdraaflgkml3euqfkxa

Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations

Ahmed Bouajjani, Peter Habermehl
1999 Theoretical Computer Science  
This approach has been used in [9, 8] to define model-checking algorithms for pushdown systems and various linear and branching-time logics, using (alternating) finitestate automata as representation structures  ...  In [5] , automata-based structures called queue-content decision diagrams (QDDs) are used to represent queue contents of FIFO-channel systems (communicating finite-state  ...  recognizable), the set of reachable configurations by these cycles is also regular.  ... 
doi:10.1016/s0304-3975(99)00033-x fatcat:wqq6l32k5bamfdokpcr2iv7edu

Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations [chapter]

Ahmed Bouajjani, Peter Habermehl
1997 Lecture Notes in Computer Science  
This approach has been used in [9, 8] to define model-checking algorithms for pushdown systems and various linear and branching-time logics, using (alternating) finitestate automata as representation structures  ...  In [5] , automata-based structures called queue-content decision diagrams (QDDs) are used to represent queue contents of FIFO-channel systems (communicating finite-state  ...  recognizable), the set of reachable configurations by these cycles is also regular.  ... 
doi:10.1007/3-540-63165-8_211 fatcat:nwhe5uin6bcjtfqzxesqntcrpu

Quantum finite automata: survey, status and research directions [article]

Amandeep Singh Bhatia, Ajay Kumar
2019 arXiv   pre-print
Quantum automata can be classified thusly: quantum finite automata, quantum sequential machine, quantum pushdown automata, quantum Turing machine and orthomodular lattice-valued automata.  ...  This article seeks to provide a comprehensive and systematic analysis of quantum finite automata models, quantum finite automata models with density operators and quantum finite automata models with classical  ...  Acknowledgments Amandeep Singh Bhatia was supported by Maulana Azad National Fellowship (MANF), funded by Ministry of Minority Affairs, Government of India.  ... 
arXiv:1901.07992v1 fatcat:yoxwrd6e55gh3heapwy3w5uuhm

Reference list of indexed articles

1999 Theoretical Computer Science  
Takanami and H. Taniguchi, A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines 24 (3) (1983) 331-336 508. E.-R.  ...  Ibarra and M.A. Palis. Two-dimensional iterative arrays: characterizations and applications 57 (I) (1988) 47-86 F.M.  ... 
doi:10.1016/s0304-3975(98)00320-x fatcat:bdgg2ekzdjahdo7g2gtwbdye6m

Reference List of Indexed Articles

2001 Information Processing Letters  
Rytter, A hardest language recognized by two-way nondeterministic pushdown automata 13 (4-5) (1981) 145-146 741. V.K.  ...  Rytter, Time complexity of languages recognized by one-way multihead pushdown automata 13 (4-5) (1981) 142-144 740. W.  ... 
doi:10.1016/s0020-0190(01)00177-6 fatcat:vksyqyokdzdztflaez5hlnchxy

Dynamical recognizers: real-time language recognition by analog computers

Cristopher Moore
1998 Theoretical Computer Science  
For instance, linear and quadratic maps can have both stack-like and queue-like memories.  ...  We encode an input word as a point in [Wd by composing iterated maps, and then apply inequalities to the resulting point to test for membership in the language.  ...  and Spootie the Cat for companionship.  ... 
doi:10.1016/s0304-3975(97)00028-5 fatcat:hy3hbmbiijf53a455zn7rk4vve

Cumulative index volumes 101–150

1995 Theoretical Computer Science  
Wang, Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines (Note) 143 (1) (1995) 123-135 (Marhenxzticcrl Games) 1 7 '?)  ...  Vigvolgyi, Bottom-up tree pushdown automata: classification and connection with rewrite systems Corradini, A. and U.  ...  Otto and L. Zhang, On weakly confluent monadic string-rewriting systems 113 (1)(1993) 119-165 Madonia, M., S. Salemi and T.  ... 
doi:10.1016/0304-3975(95)90003-9 fatcat:nu4xbvgzrvbfvicemt4sviortu

Machine models and linear time complexity

Kenneth W. Regan
1993 ACM SIGACT News  
The simulation is on-line if each step of M 1 is simulated by step(s) of M 2 in some transparent manner-see [vEB90, LL92b] for discussion of how to formalize this.  ...  Two other reasons are that Linear Time seems not to have as many pleasant closure properties as Polynomial Time, and often depends on fussy details of how information is represented.  ...  Loui and Lane A. Hemaspaandra for helpful comments on earlier drafts.  ... 
doi:10.1145/166589.166591 fatcat:6pdjyssqozb27bixcgzaplbh74

Model-checking CTL* over flat Presburger counter systems

Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
2010 Journal of Applied Non-Classical Logics  
This paper studies model-checking of fragments and extensions of CTL* on infinitestate counter systems, where the states are vectors of integers and the transitions are determined by means of relations  ...  reachability properties of counter systems are undecidable, but we have identified a natural class of admissible counter systems (ACS) for which we show that the quantification over paths in CTL* can be simulated  ...  Such representations can be based on: -automata (finite, pushdown, on infinite words or trees, etc.), as in pushdown graphs (Muller et al., 1985) , prefix-recognizable graphs (Caucal, 2003) , and automatic  ... 
doi:10.3166/jancl.20.313-344 fatcat:57igjjmoqbcxlfdds7bebiaczu

Cumulative index volumes 101–150

1995 Theoretical Computer Science  
Rytter, On two-dimensional pattern matching by optimal parallel algorithms (Nofe) 132 (l-2) (1994) 4033414 Crole, R.L., Computational adequacy of the FIX-logic I36 (1) (1994) 217-242 CrvenkoviC,  ...  Gilleron and S. Vigviilgyi, Bottom-up tree pushdown automata: classifica- tion and connection with rewrite systems 127 (I) (1994) 69 98 Cori, R., see A.  ...  Goles I10 ( (1994) Marek, W. and V.S. Subrahmanian. The relationshlp between stable, supported, default and autoepistemic semantics for general logic programs Margenstern.  ... 
doi:10.1016/0304-3975(95)80004-2 fatcat:aobsm3zfjnhhtpd22ucvxasucy
« Previous Showing results 1 — 15 out of 26 results