scientific article; zbMATH DE number 7354705

Cited in

(only showing first 100 items - show all)

Finite automata and unary languages
Program schemata as automata. I
Decomposition theorems for finite sequential machines
Noiselike transforms of \(\omega\)-events
Complete system of equivalent transformations for two-tape automata with disjoint loops
Interleaving isotactics -- an equivalence notion on behaviour abstractions
Copyless cost-register automata: structure, expressiveness, and closure properties
ptype: probabilistic type inference
A logical and graphical framework for reaction systems
The descriptional power of queue automata of constant length
Finite sequentiality of unambiguous max-plus tree automata
Solving string problems on graphs using the labeled direct product
Deterministic one-way simulation of two-way deterministic finite automata over small alphabets
Disambiguation of weighted tree automata
Converting nondeterministic two-way automata into small deterministic linear-time machines
State complexity of binary coded regular languages
Operations on subregular languages and nondeterministic state complexity
Tree automata and pigeonhole classes of matroids. I
Classes of discrete optimization problems and their decision problems
Determinizing monitors for HML with recursion
Robust biomolecular finite automata
Context-free coalgebras
Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
New operations and regular expressions for two-dimensional languages over one-letter alphabet
Bracketed context-free languages
Probabilistic tree automata and context free languages
Multitape finite automata with rewind instructions
On the decidability of the valuedness problem for two-way finite transducers
Improved complement for two-way alternating automata
Liveness in broadcast networks
Quantitative vs. weighted automata
On the average complexity of partial derivative transducers
On the hierarchy of block deterministic languages
More on deterministic and nondeterministic finite cover automata (extended abstract)
From two-way to one-way finite automata -- three regular expression-based methods
Structured Frequency Algorithms
Planning to chronicle
On the size of two-way reasonable automata for the liveness problem
Expression-Based Aliasing for OO–languages
More Concise Representation of Regular Languages by Automata and Regular Expressions
On the State Complexity of Operations on Two-Way Finite Automata
Deterministic Input-Reversal and Input-Revolving Finite Automata
Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
Nondeterministic Moore automata and Brzozowski's minimization algorithm
A categorical approach to syntactic monoids
Head and state hierarchies for unary multi-head finite automata
Reachability analysis of reversal-bounded automata on series-parallel graphs
Not by equations alone. Reasoning with extensible effects
Translating regular expressions into small -free nondeterministic finite automata
Multi-Valued Reasoning about Reactive Systems
Rational and Recognisable Power Series
scientific article; zbMATH DE number 7559164 (Why is no real title available?)
On the complexity of string matching for graphs
Minimizing GFG Transition-Based Automata
From Nondeterministic to Multi-Head Deterministic Finite-State Transducers
scientific article; zbMATH DE number 7561705 (Why is no real title available?)
Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
On the equivalence problem for deterministic multitape automata and transducers
Minimization and canonization of GFG transition-based automata
A Characterisation of Pi^0_2 Regular Tree Languages
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
Multilinear representations of free pros
Backward Deterministic Büchi Automata on Infinite Words
An Automata Theoretic Approach to Rational Tree Relations
Church’s Problem and a Tour through Automata Theory
From Monadic Logic to PSL
Automata-Theoretic Model Checking Revisited
Lattice Automata
An overview of synchronous communication for control of decentralized discrete-event systems
Unambiguity in automata theory
The state complexity of permutations on finite languages over binary alphabets
On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
Zur Theorie abstrakter stochastischer Automaten
Unrecognizable Sets of Numbers
A Theory of Computer Instructions
1-limited automata: witness languages and techniques
Reordering Derivatives of Trace Closures of Regular Languages.
Kleene algebra with observations
Iterative pairs and multitape automata
The fully compressed subgroup membership problem
Language recognition power and succinctness of affine automata
Logical omniscience
On the Complexity of String Matching for Graphs
Nondeterministic operational complexity in subregular languages
The epistemology of nondeterminism
Weighted two-way transducers
Runtime Verification with Imperfect Information Through Indistinguishability Relations
scientific article; zbMATH DE number 7723593 (Why is no real title available?)
State complexity of binary coded regular languages
State-based opacity of labeled real-time automata
The different shades of infinite session types
Weighted two-way transducers
Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification
Two-Way Non-Uniform Finite Automata
On Jaffe's pumping lemma, revisited
Complexity of exclusive nondeterministic finite automata
A language-based diagnosis framework for permanent and intermittent faults
Jump complexity of finite automata with translucent letters
Binary coded unary regular languages
Two-way machines and de Bruijn words

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4991691)