Results 51 to 60 of about 283,589 (317)
Finitely generated subgroups of free groups as formal languages and their cogrowth [PDF]
Groups, Complexity, Cryptology, 2021 For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language.
Arman Darbinyan +2 more
doaj +1 more source
Non-Deterministic Updates of Boolean Networks [PDF]
International Workshop on Cellular Automata and Discrete Complex Systems, 2021 Boolean networks are discrete dynamical systems where each automaton has its own Boolean function for computing its state according to the configuration of the network.
Loïc Paulevé, Sylvain Sené
semanticscholar +1 more source
Regular omega-Languages with an Informative Right Congruence [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon automaton. The same
Dana Angluin, Dana Fisman
doaj +1 more source
Token Games and History-Deterministic Quantitative-Automata [PDF]
Logical Methods in Computer Science, 2023 A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in solving games and
Udi Boker, Karoliina Lehtinen
doaj +1 more source
Higher-Order Pushdown Systems with Data [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We propose a new extension of higher-order pushdown automata, which allows to use an infinite alphabet. The new automata recognize languages of data words (instead of normal words), which beside each its letter from a finite alphabet have a data value ...
Paweł Parys
doaj +1 more source
On h-Lexicalized Restarting Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Following some previous studies on restarting automata, we introduce a refined model - the h-lexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics.
Martin Plátek, Friedrich Otto
doaj +1 more source
Efficient Construction of the Equation Automaton
Algorithms, 2021 This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression.
Faissal Ouardi +2 more
doaj +1 more source
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs
International Colloquium on Automata, Languages and Programming, 2022 We present an algorithm that constructs a deterministic Büchi automaton in polynomial time from given sets of positive and negative example words. This learner constructs multiple DFAs using a polynomial-time active learning algorithm on finite words as ...
Leon Bohn, Christof Löding
semanticscholar +1 more source
Learning Cover Context-Free Grammars from Structural Data [PDF]
Scientific Annals of Computer Science, 2014 We consider the problem of learning an unknown context-free gram- mar from its structural descriptions with depth at most ℓ. The structural descriptions of the context-free grammar are its unlabelled derivation trees. The goal is to learn a cover context-
M. Marin, G. Istrate
doaj +1 more source
A Structural Construction of a Deterministic Position Automaton
International Journal of Computer Applications, 2013 Every regular expression can be transformed into a Nondeterministic Finite Automaton (NFA) with or without transitions. A well known algorithm called subset construction technique is used for conversion of NFA into DFA. In this paper, initially, the construction of the position automaton is given for the same.
N. Murugesan, O. V.ShanmugaSundaram
openaire +1 more source