English
Related papers

Related papers: Partially Ordered Two-way B\"uchi Automata

200 papers

Despite fermion doubling, a two-dimensional quasi-relativistic spin-1/2 system can still lead to true fractionalization of electrical charge, when a massive ordered phase supports a "half-vortex". Such topological defect is possible when…

Mesoscale and Nanoscale Physics · Physics 2016-04-13 Bitan Roy , Igor F. Herbut

Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…

Formal Languages and Automata Theory · Computer Science 2019-05-24 Loris D'Antoni , Tiago Ferreira , Matteo Sammartino , Alexandra Silva

The paper considers the Cauchy problem for the system of partial differential equations of fractional order $D_t^{\mathcal{B}} {U}(t,x) + \mathbb{A}(D) {U} (t,x)=H(t,x) $. Here $U$ and $H$ are vector-functions, the $m\times m$ matrix of…

Analysis of PDEs · Mathematics 2024-05-24 Ravshan Ashurov , Ilyoskhuja Sulaymonov

We prove that, paying a polynomial increase in size only, every unrestricted two-way nondeterministic finite automaton (2NFA) can be complemented by a 1-limited automaton (1-LA), a nondeterministic extension of 2NFAs still characterizing…

Formal Languages and Automata Theory · Computer Science 2025-07-16 Bruno Guillon , Luca Prigioniero , Javad Taheri

Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have found several applications, for instance in transducer…

Formal Languages and Automata Theory · Computer Science 2019-07-23 Emmanuel Filiot , Shibashis Guha , Nicolas Mazzocchi

We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the obtained language families with those induced by deterministic…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Markus Holzer , Sebastian Jakobi

Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring…

Formal Languages and Automata Theory · Computer Science 2009-07-29 Christel Baier , Nathalie Bertrand , Marcus Größer

Logical models have been successfully used to describe regulatory and signaling networks without requiring quantitative data. However, existing data is insufficient to adequately define a unique model, rendering the parametrization of a…

Discrete Mathematics · Computer Science 2019-01-24 José E. R. Cury , Pedro T. Monteiro , Claudine Chaouiya

In this paper we consider a nondeterministic computation by deterministic multi-head 2-way automata having a read-only access to an auxiliary memory. The memory contains additional data (a guess) and computation is successful iff it is…

Computational Complexity · Computer Science 2008-11-18 M. N. Vyalyi

We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,\alpha), where \alpha is a Boolean variable. Intuitively, with Boolean dependence…

Logic · Mathematics 2014-06-30 Johannes Ebbing , Lauri Hella , Peter Lohmann , Jonni Virtema

The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…

Logic in Computer Science · Computer Science 2025-01-29 Emmanuel Hainry , Bruce M. Kapron , Jean-Yves Marion , Romain Péchoux

The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rabin and Scott and, independently, Shepherdson, proved that these models, both in the deterministic and in the nondeterministic versions, have…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Giovanni Pighizzini

The simulation of deterministic pushdown automata defined over a one-letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s…

Formal Languages and Automata Theory · Computer Science 2009-05-11 Giovanni Pighizzini

Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…

Formal Languages and Automata Theory · Computer Science 2023-02-15 Olivier Carton , Gaëtan Douéneau-Tabot , Emmanuel Filiot , Sarah Winter

We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on…

Formal Languages and Automata Theory · Computer Science 2017-09-08 Manfred Droste , Temur Kutsia , George Rahonis , Wolfgang Schreiner

We present the tool Ranker for complementing B\"uchi automata (BAs). Ranker builds on our previous optimizations of rank-based BA complementation and pushes them even further using numerous heuristics to produce even smaller automata.…

Formal Languages and Automata Theory · Computer Science 2022-06-07 Vojtěch Havlena , Ondřej Lengál , Barbora Šmahlíková

This paper addresses a motion planning problem of the second-order chained form system. The author presents a novel control approach based on switching a state. The second-order chained form system is composed of three subsystems including…

Systems and Control · Electrical Eng. & Systems 2020-05-25 Masahide Ito

To handle the control difficulties caused by high-order dynamics, a control structure based on fractional order [proportional integral] (PI) controller and fractional order Smith-like predictor for a class of high order systems in the type…

Systems and Control · Computer Science 2019-04-18 Zhenlong Wu , Jie Yuan , Yuquan Chen , Donghai Li , YangQuan Chen

Consider a classical elliptic pseudodifferential operator $P$ on ${\Bbb R}^n$ of order $2a$ ($0<a<1)$ with even symbol. For example, $P=A(x,D)^a$ where $A(x,D)$ is a second-order strongly elliptic differential operator; the fractional…

Analysis of PDEs · Mathematics 2016-04-25 Gerd Grubb

In this paper, we study infinite dimensional stochastic systems having both unbounded control and observation operators. First of all, using a semigroup approach, we give another take of the well-posedness of such systems treated in [SIAM…

Optimization and Control · Mathematics 2021-05-31 Fatima-Zahra Lahbiri , Said Hadd