Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2024
Weights of formal languages based on geometric series with an application to automatic grading
AbstractWe present a weight measure on formal languages based on the summands of a geometric series discounted by the fraction of words of certain length in the language, guaranteeing the weight to be a real value between 0 and 1 for any language. We ...
- research-articleFebruary 2024
Energy complexity of regular languages
AbstractEach step that results in a bit of information being “forgotten” by a computing device has an intrinsic energy cost. Although any Turing machine can be rewritten to be thermodynamically reversible without changing the recognized language, finite ...
- research-articleAugust 2023
The cut operation in subclasses of convex languages
AbstractThe cut of two languages is a subset of their concatenation given by the leftmost maximal prefix match. We study the state complexity of the cut operation assuming that both operands belong to some, possibly different, subclasses of convex ...
- research-articleAugust 2023
Iterated uniform finite-state transducers on unary languages
AbstractAn iterated uniform finite-state transducer executes the same length-preserving transduction in iterative sweeps. The first sweep occurs on the input string, while any subsequent sweep works on the output of the previous one. All sweeps always ...
Highlights
- We study Iterated Uniform Finite-State Transducers (IUFSTs) working on unary languages.
- We compare IUFSTs size with that of unary classical finite-state automata.
- We relate IUFSTs and one-way cellular automata recognition power.
- research-articleMarch 2023
Ordering regular languages and automata: Complexity
AbstractGiven an order of the underlying alphabet, we can lift it to the states of a finite deterministic automaton: to compare states we use the order of the strings reaching them. When the order on strings is the co-lexicographic one and ...
Highlights
- The best possible encodings (compression) of DFAs and NFAs are obtained by imposing a suitable order on their states.
-
- research-articleFebruary 2023
Higher-order concepts for the potential infinite
AbstractThe lambda calculus can be seen as a language that connects mathematics with computer science. However, the models used in both disciplines have different basic properties. In computer science these models are mainly based on domain ...
Highlights- The paper presents a mathematical formulation of a potential infinite set, called factor system.
- research-articleJanuary 2023
Re-examining regular expressions with backreferences
Theoretical Computer Science (TCSC), Volume 940, Issue PAPages 66–80https://doi.org/10.1016/j.tcs.2022.10.041AbstractMost modern regular expression matching libraries (one of the rare exceptions being Google's RE2) allow backreferences, operations which bind a substring to a variable, allowing it to be matched again verbatim. However, both real-world ...
- research-articleNovember 2022
PPTL specification mining based on LNFG
Theoretical Computer Science (TCSC), Volume 937, Issue CPages 85–95https://doi.org/10.1016/j.tcs.2022.09.032AbstractA formal specification is a formal description of system requirements, which is a necessity for formal verification. Due to various reasons, some systems lack of formal specifications. Compared with CTL and LTL, Propositional ...
Highlights- The framework of PPTLMiner+ and main algorithms are introduced.
- A practical ...
- research-articleOctober 2022
Fast computations on ordered nominal sets
Theoretical Computer Science (TCSC), Volume 935, Issue CPages 82–104https://doi.org/10.1016/j.tcs.2022.09.002AbstractNominal automata are models for recognising languages over infinite alphabets, based on the algebraic notion of nominal set. Motivated by their use in automata theory, we show how to compute efficiently with nominal sets over the so-...
- research-articleAugust 2022
Deterministic top-down tree automata with Boolean deterministic look-ahead
Theoretical Computer Science (TCSC), Volume 927, Issue CPages 42–64https://doi.org/10.1016/j.tcs.2022.05.027AbstractWe introduce deterministic top-down tree languages with Boolean deterministic look-ahead. We show that the class of deterministic top-down tree languages with deterministic top-down look-ahead and the class of Boolean deterministic ...
Highlights- Introducing and studying deterministic top-down tree automata with Boolean deterministic look-ahead.
- research-articleAugust 2022
Computable model discovery and high-level-programming approximations to algorithmic complexity
Theoretical Computer Science (TCSC), Volume 927, Issue CPages 31–41https://doi.org/10.1016/j.tcs.2022.05.026AbstractMotivated by algorithmic information theory, the problem of program discovery can help find candidates of underlying generative mechanisms of natural and artificial phenomena. The uncomputability of such inverse problem, however, ...
Highlights- We explore an inverse problem for model discovery based on principles of algorithmic information.
- research-articleAugust 2022
Solving dependency quantified Boolean formulas using quantifier localization
Theoretical Computer Science (TCSC), Volume 925, Issue CPages 1–24https://doi.org/10.1016/j.tcs.2022.03.029AbstractDependency quantified Boolean formulas (DQBFs) are a powerful formalism, which subsumes quantified Boolean formulas (QBFs) and allows an explicit specification of dependencies of existential variables on universal variables. Driven by ...
- research-articleJune 2022
Suffix-connected languages
Theoretical Computer Science (TCSC), Volume 923, Issue CPages 126–143https://doi.org/10.1016/j.tcs.2022.05.001AbstractInspired by a series of papers initiated in 2015 by Berthé et al., we introduce a new condition called suffix-connectedness. We show that the groups generated by the return sets of a uniformly recurrent suffix-connected language lie in ...
- research-articleJune 2022
Complexity results on register context-free grammars and related formalisms
Theoretical Computer Science (TCSC), Volume 923, Issue CPages 99–125https://doi.org/10.1016/j.tcs.2022.04.055AbstractRegister context-free grammars (RCFG), register pushdown automata (RPDA) and register tree automata (RTA) are extensions of their classical counterparts to handle data values in a restricted way. These extended models are paid ...
- research-articleJune 2022
Agreeing within a few writes
Theoretical Computer Science (TCSC), Volume 922, Issue CPages 283–299https://doi.org/10.1016/j.tcs.2022.04.030AbstractThe notion of adopt-commit object [29] is of pivotal importance in understanding the consensus problem. This object models an attempt of the processes to agree on some common value, and precisely captures the cost of the fast path a ...
- research-articleJune 2022
Computational completeness of spiking neural P systems with inhibitory rules for generating string languages
Theoretical Computer Science (TCSC), Volume 920, Issue CPages 64–75https://doi.org/10.1016/j.tcs.2022.02.025AbstractSpiking neural P systems with inhibitory rules (in short, SNP-IR systems) are a distributed parallel computing model, abstracted by the spiking and inhibitory mechanisms of biological neurons. Computational completeness of SNP-IR ...
Highlights- We prove that the family of regular languages can be generated by SNP-IR systems.
- research-articleJune 2022
From reversible programming languages to reversible metalanguages
Theoretical Computer Science (TCSC), Volume 920, Issue CPages 46–63https://doi.org/10.1016/j.tcs.2022.02.024Highlights- A reversible metalanguage for describing the semantics of programming languages in a way that guarantees reversibility.
During the past decade reversible programming languages have been formalized using various established semantics frameworks. However, these semantics fail to effectively specify the distinct properties of reversible languages at the ...
- research-articleJune 2022
Quotients and atoms of reversible languages
Theoretical Computer Science (TCSC), Volume 920, Issue CPages 33–45https://doi.org/10.1016/j.tcs.2022.02.023AbstractWe consider several reversible finite automaton models which have been introduced over decades, and study some properties of their languages. In particular, we look at the question whether the quotients and atoms of a specific class of ...
Highlights- We study the quotients and atoms of various models of reversible languages.
- We ...
- research-articleApril 2022
On distributability
Theoretical Computer Science (TCSC), Volume 913, Issue CPages 151–173https://doi.org/10.1016/j.tcs.2022.03.028AbstractThe Actor model of computation is the backbone for the design of some of the most successful distributed programming platforms, Erlang and Akka. It builds upon asynchronous message-passing (liberating senders from waiting) and unique ...
Highlights
- Theory and practice of distributed systems.
- Absolute expressive power.