E-Books durchsuchen

The New Complexity Landscape Around Circuit Minimization

Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases

Approaching Arithmetic Theories with Finite-State Automata

Recompression: Technique for Word Equations and Compressed Data

How to Prove that a Language Is Regular or Star-Free?

Deciding Classes of Regular Languages: The Covering Approach

Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle

<inline-formula><alternatives><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\langle \mathbb {R}, +,<,1 \rangle $$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula> Is Decidable in <inline-formula><alternatives><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\langle \mathbb {R}, +,< ,\mathbb {Z}\rangle $$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula>

Ordered Semiautomatic Rings with Applications to Geometry

Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions

Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models

Windable Heads and Recognizing NL with Constant Randomness

Alternating Finite Automata with Limited Universal Branching

Pebble-Intervals Automata and FO<inline-formula><alternatives><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^2$$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula> with Two Orders

Limited Two-Way Deterministic Finite Automata with Advice

On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function

Complexity Issues of String to Graph Approximate Matching

Complexity of Automatic Sequences

Context-Sensitive Fusion Grammars Are Universal

Cyclic Shift on Multi-component Grammars

The Automatic Baire Property and an Effective Property of <inline-formula><alternatives><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula>-Rational Functions

The Power of Programs over Monoids in <bold>J</bold>

Geometrically Closed Positive Varieties of Star-Free Languages

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas

On the Weisfeiler-Leman Dimension of Fractional Packing

Input Strictly Local Tree Transducers

Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words

Reducing the Ambiguity of Parikh Matrices

On Collapsing Prefix Normal Words

Simplified Parsing Expression Derivatives

Complete Variable-Length Codes: An Excursion into Word Edit Operations