Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Amaldev Manuel"'
Publikováno v:
Fundamenta Informaticae
Fundamenta Informaticae, 2021, 180, pp.333-350. ⟨10.3233/fi-2021-2045⟩
Fundamenta Informaticae, 2021, 180, pp.333-350. ⟨10.3233/fi-2021-2045⟩
International audience; We present first-order (FO) and monadic second-order (MSO) logics with predicates 'between' and 'neighbour' that characterise the class of regular languages that are closed under the reverse operation and its subclasses. The t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6ba802983eabb81ee76b1bea0193871
https://doi.org/10.3233/fi-2021-2045
https://doi.org/10.3233/fi-2021-2045
Autor:
Amaldev Manuel, Dhruv Nevatia
Publikováno v:
LICS
We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are involution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c430fec4f81d773d9d7bb5d69e7f25c7
Publikováno v:
Developments in Language Theory ISBN: 9783030248857
DLT
DLT
We present \(\mathsf {MSO}\) and \(\mathsf {FO}\) logics with predicates ‘between’ and ‘neighbour’ that characterise various fragments of the class of regular languages that are closed under the reverse operation. The standard connections tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7a12e5d7193eb0ffb3a519081cbe841
https://doi.org/10.1007/978-3-030-24886-4_13
https://doi.org/10.1007/978-3-030-24886-4_13
Autor:
Md. Aquil Khan, Amaldev Manuel
This book collects the refereed proceedings of the 8th Indian Conference on Logic and Its Applications, ICLA 2019, held in Delhi, India, in March 2019. The volume contains 13 full revised papers along with 6 invited talks presented at the conference.
Autor:
Amaldev Manuel, Ramaswamy Ramanujam
Publikováno v:
International Journal of Foundations of Computer Science. 22:863-882
In the theory of automata over infinite alphabets, a central difficulty is that of finding a suitable compromise between expressiveness and algorithmic complexity. We propose an automaton model where we count the multiplicity of data values on an inp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f58d7cc6c7b1b3e3911de3f16383f3a
https://doi.org/10.1142/s0129054111008465
https://doi.org/10.1142/s0129054111008465
Publikováno v:
Mathematical Foundations of Computer Science 2014 ISBN: 9783662445211
MFCS (1)
MFCS (1)
We provide new characterizations of the class of regular cost functions (Colcombet 2009) in terms of first-order logic. This extends a classical result stating that each regular language can be defined by a first-order formula over the infinite tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc8c6bea2b1ad84a20744a3d212da56d
https://doi.org/10.1007/978-3-662-44522-8_33
https://doi.org/10.1007/978-3-662-44522-8_33
Autor:
Amaldev Manuel, Ramaswamy Ramanujam
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642044199
RP
RP
In the theory of automata over infinite alphabets, a central difficulty is that of finding a suitable compromise between expressiveness and algorithmic complexity. We propose an automaton model where we count the multiplicity of data values on an inp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4202b70dc9f9db71a1dd0e4f19573c12
https://doi.org/10.1007/978-3-642-04420-5_14
https://doi.org/10.1007/978-3-642-04420-5_14