Results 151 to 160 of about 1,221 (189)
Some of the next articles are maybe not open access.
Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW)Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not all theoretical results have realized their promising applications.
A. Egri-Nagy
semanticscholar +1 more source
Topoi of automata I: Four topoi of automata and regular languages
arXiv.orgBoth topos theory and automata theory are known for their multi-faceted nature and relationship with topology, algebra, logic, and category theory. This paper aims to clarify the topos-theoretic aspects of automata theory, particularly demonstrating ...
Ryuya Hora
semanticscholar +1 more source
Eve-positional languages: putting order into Büchi automata
arXiv.orgAn $\omega$-regular language is Eve-positional if, in all games with this language as objective, the existential player can play optimally without keeping any information from the previous moves. This notion plays a crucial role in verification, automata
Olivier Idir
semanticscholar +1 more source
Cybersecurity and Cyberforensics Conference, 2019
Using the theories of many-valued logic and semi-tensor product of matrices (STP), this paper investigates how to mathematically determine whether or not a regular language is recognized by a finite automaton. To this end, the behavior of finite automata
Jumei Yue +4 more
semanticscholar +1 more source
Using the theories of many-valued logic and semi-tensor product of matrices (STP), this paper investigates how to mathematically determine whether or not a regular language is recognized by a finite automaton. To this end, the behavior of finite automata
Jumei Yue +4 more
semanticscholar +1 more source
An algebraic characterisation of Eve-positional languages
arXiv.orgWe present a new algebraic characterisation of Eve-positionality for $\omega$-regular languages. It involves only a limited number of elementary local properties to be checked.
Thomas Colcombet, Olivier Idir
semanticscholar +1 more source
Graded Monads in the Semantics of Nominal Automata
arXiv.orgNominal automata models serve as a formalism for data languages, and in fact often relate closely to classical register models. The paradigm of name allocation in nominal automata helps alleviate the pervasive computational hardness of register models in
Hannes Schulze +2 more
semanticscholar +1 more source
Structure and Behavior of Graph Automata Based on the Monopoly-Forcing Set
Journal of Algebraic Hyperstructures and Logical AlgebrasIn this note, we show that automata theory is a suitable tool for analyzing monopoly-forcing processes. Also, we present the notion of mono-forcing automata by using the monopoly-forcing set for graphs.
M. Shamsizadeh, K. Abolpour
semanticscholar +1 more source
Complexity Classes Arising from Circuits over Finite Algebraic Structures
arXiv.orgMost classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating factor.
Piotr Kawalek, Jacek Krzaczkowski
semanticscholar +1 more source
Stochastic Languages at Sub-stochastic Cost
arXiv.orgWhen does a deterministic computational model define a probability distribution? What are its properties? This work formalises and settles this stochasticity problem for weighted automata, and its generalisation cost register automata (CRA). We show that
Smayan Agarwal, Aalok Thakkar
semanticscholar +1 more source
The Algebraic Theory of Parikh Automata
Theory of Computing Systems, 2017M. Cadilhac, Andreas Krebs, P. McKenzie
semanticscholar +2 more sources