ω-Continuous semirings, algebraic systems and pushdown automata

2005 ◽  
pp. 103-110 ◽  
Author(s):  
Werner Kuich
Keyword(s):  
Algebraic Systems ◽  
Pushdown Automata

FUZZY CONJUNCTIVE GRAMMAR AND FUZZY SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA

2020 ◽  
Vol 9 (11) ◽  
pp. 9463-9480
Author(s):  
R. Pathrakumar ◽  
M. Rajasekar
Keyword(s):  
Pushdown Automata ◽  
Conjunctive Grammar

scholarly journals Differential-algebraic systems are generically controllable and stabilizable

2021 ◽  
Author(s):  
Achim Ilchmann ◽  
Jonas Kirchhoff
Keyword(s):  
Algebraic Geometry ◽  
Linear Time ◽  
Differential Algebraic Equations ◽  
Algebraic Equations ◽  
Algebraic Systems ◽  
Linear Time Invariant ◽  
Survey Article ◽  
Link Type ◽  
Invariant Differential ◽  
Time Invariant

AbstractWe investigate genericity of various controllability and stabilizability concepts of linear, time-invariant differential-algebraic systems. Based on well-known algebraic characterizations of these concepts (see the survey article by Berger and Reis (in: Ilchmann A, Reis T (eds) Surveys in differential-algebraic equations I, Differential-Algebraic Equations Forum, Springer, Berlin, pp 1–61. 10.1007/978-3-642-34928-7_1)), we use tools from algebraic geometry to characterize genericity of controllability and stabilizability in terms of matrix formats.

scholarly journals Reduced order multirate schemes for coupled differential-algebraic systems

2021 ◽  
Author(s):  
M.W.F.M. Bannenberg ◽  
A. Ciccazzo ◽  
M. Günther
Keyword(s):  
Algebraic Systems ◽  
Reduced Order

scholarly journals Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre
Keyword(s):  
Model Checking ◽  
Free Variable ◽  
Higher Order ◽  
Second Order ◽  
Effective Solution ◽  
Parity Games ◽  
Transition Graphs ◽  
Second Order Logic ◽  
Pushdown Automata ◽  
Monadic Second Order Logic

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.

Sign in / Sign up

Export Citation Format

Share Document