E-Books durchsuchen

Language and Automata Theory and Applications [2021]

1
On Language Varieties Without Boolean Operations
2
Partially Directed Animals with a Bounded Number of Holes
3
On the Computational Power of Programs over <inline-formula><alternatives><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>BA</mi><mn>2</mn></msub></math><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {BA}_2$$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula> Monoid
4
Location Based Automata for Expressions with Shuffle
5
Succinct Representations for (Non)Deterministic Finite Automata
6
Optimising Attractor Computation in Boolean Automata Networks
7
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata
8
Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete
9
On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits
10
On Hardest Languages for One-Dimensional Cellular Automata
11
Usefulness of Information and Unary Languages
12
Learnability and Positive Equivalence Relations
13
Learning Mealy Machines with One Timer
14
Temporal Logics with Language Parameters
15
Commutative Rational Term Rewriting
16
Context-Free Grammars with Lookahead
17
Finite-Word Hyperlanguages
18
Tree-Like Unit Refutations in Horn Constraint Systems
19
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding
20
Approximated Determinisation of Weighted Tree Automata
21
Sequentiality of Group-Weighted Tree Automata
22
An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs
23
On Balanced Sequences and Their Asymptotic Critical Exponent
24
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words
25
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets
26
Cadences in Grammar-Compressed Strings
Feedback