Results 61 to 70 of about 4,638,570 (374)
On regular languages over power sets
Journal of Language Modelling, 2016 The power set of a finite set is used as the alphabet of a string interpreting a sentence of Monadic Second-Order Logic so that the string can be reduced (in a straightforward way) to the symbols occurring in the sentence.
Tim Fernando
doaj +1 more source
On Learning Nominal Automata with Binders [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We investigate a learning algorithm in the context of nominal automata, an extension of classical automata to alphabets featuring names. This class of automata captures nominal regular languages; analogously to the classical language theory, nominal ...
Yi Xiao, Emilio Tuosto
doaj +1 more source
Closure and Decision Properties for Higher-Dimensional Automata [PDF]
arXiv, 2023 We report some further developments regarding the language theory of higher-dimensional automata (HDAs). Regular languages of HDAs are sets of finite interval partially ordered multisets (pomsets) with interfaces. We show a pumping lemma which allows us to expose a class of non-regular languages. Concerning decision and closure properties, we show that
arxiv
Decision trees for regular factorial languages
Array, 2022 In this paper, we study arbitrary regular factorial languages over a finite alphabet Σ. For the set of words L(n)of the length n belonging to a regular factorial language L, we investigate the depth of decision trees solving the recognition and the ...
Mikhail Moshkov
doaj
Power of Randomization in Automata on Infinite Strings [PDF]
Logical Methods in Computer Science, 2011 Probabilistic B\"uchi Automata (PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can be defined.
Rohit Chadha +2 more
doaj +1 more source
Efficient Separability of Regular Languages by Subsequences and Suffixes [PDF]
International Colloquium on Automata, Languages and Programming, 2013 When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof.
Wojciech Czerwinski +2 more
semanticscholar +1 more source
Verifying proofs in constant depth [PDF]
, 2011 In this paper we initiate the study of proof systems where verification of proofs proceeds by NC circuits. We investigate the question which languages admit proof systems in this very restricted model. Formulated alternatively, we ask which languages can
B. Applebaum +15 more
core +2 more sources
Query learning of derived $\omega$-tree languages in polynomial time [PDF]
Logical Methods in Computer Science, 2019 We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of $\omega$-tree languages derived from weak regular $\omega ...
Dana Angluin +2 more
doaj +1 more source
One-Unambiguous Regular Languages
Information and Computation, 1998 AbstractThe ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic meta-language for the definition of textual markup systems. In the standard, the right-hand sides of productions are based on regular expressions, although only regular expressions that denote words unambiguously, in the sense of the ISO standard, are ...
Bruggemann-Klein, Anne, Wood, Derick
openaire +5 more sources
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages [PDF]
arXiv, 2021 We identify a subclass of the regular commutative languages that is closed under the iterated shuffle, or shuffle closure. In particular, it is regularity-preserving on this subclass. This subclass contains the commutative group languages and, for every alphabet $\Sigma$, the class $\textbf{Com}^+(\Sigma^*)$ given by the ordered variety $\textbf{Com}^+$
arxiv