Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity

Author(s):  
Yo-Sub Han ◽  
Sang-Ki Ko ◽  
Kai Salomaa
2019 ◽  
Vol 30 (06n07) ◽  
pp. 1069-1089
Author(s):  
Markus Holzer ◽  
Martin Kutrib

We introduce the concept of one-time nondeterminism as a new kind of limited nondeterminism for finite state machines and pushdown automata. Roughly speaking, one-time nondeterminism means that at the outset the computation is nondeterministic, but whenever it performs a guess, this guess is fixed for the rest of the computation. We characterize the computational power of one-time nondeterministic finite automata (OTNFAs) and one-time nondeterministic pushdown devices. Moreover, we study the descriptional complexity of these machines. For instance, we show that for an [Formula: see text]-state OTNFA with a sole nondeterministic state, that is nondeterministic for only one input symbol, [Formula: see text] states are sufficient and necessary in the worst case for an equivalent deterministic finite automaton. In case of pushdown automata, the conversion of a nondeterministic to a one-time nondeterministic as well as the conversion of a one-time nondeterministic to a deterministic one turn out to be non-recursive, that is, the trade-offs in size cannot be bounded by any recursive function.


2020 ◽  
Vol 9 (11) ◽  
pp. 9463-9480
Author(s):  
R. Pathrakumar ◽  
M. Rajasekar

2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.


2015 ◽  
Vol 17 (1) ◽  
pp. 1-45 ◽  
Author(s):  
Rémy Chrétien ◽  
Véronique Cortier ◽  
Stéphanie Delaune

2021 ◽  
Vol 117 ◽  
pp. 202-241
Author(s):  
Lorenzo Clemente ◽  
Sławomir Lasota
Keyword(s):  

Author(s):  
Björn Lellmann ◽  
Francesca Gulisano ◽  
Agata Ciabattoni

Abstract Over the course of more than two millennia the philosophical school of Mīmāṃsā has thoroughly analyzed normative statements. In this paper we approach a formalization of the deontic system which is applied but never explicitly discussed in Mīmāṃsā to resolve conflicts between deontic statements by giving preference to the more specific ones. We first extend with prohibitions and recommendations the non-normal deontic logic extracted in Ciabattoni et al. (in: TABLEAUX 2015, volume 9323 of LNCS, Springer, 2015) from Mīmāṃsā texts, obtaining a multimodal dyadic version of the deontic logic $$\mathsf {MD}$$ MD . Sequent calculus is then used to close a set of prima-facie injunctions under a restricted form of monotonicity, using specificity to avoid conflicts. We establish decidability and complexity results, and investigate the potential use of the resulting system for Mīmāṃsā philosophy and, more generally, for the formal interpretation of normative statements.


2005 ◽  
Vol 16 (04) ◽  
pp. 707-722 ◽  
Author(s):  
MARKUS LOHREY

Several complexity and decidability results for automatic monoids are shown: (i) there exists an automatic monoid with a P-complete word problem, (ii) there exists an automatic monoid such that the first-order theory of the corresponding Cayley-graph is not elementary decidable, and (iii) there exists an automatic monoid such that reachability in the corresponding Cayley-graph is undecidable. Moreover, it is shown that for every hyperbolic group the word problem belongs to LOGCFL, which improves a result of Cai [8].


2019 ◽  
pp. 161-182
Author(s):  
Ganesh Lalitha Gopalakrishnan
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document