scientific article; zbMATH DE number 1033559

Recommendations

scientific article; zbMATH DE number 3902039
scientific article; zbMATH DE number 459361
scientific article; zbMATH DE number 1333447
Automatentheorie und Logik
scientific article; zbMATH DE number 5898706
Automata and algebraicity
Automata Studies. (AM-34)
Automata theory and its applications
Automata Theory and Formal Languages

Cited in

(only showing first 100 items - show all)

A tree distinguishing polynomial
Counter machines
Algorithmic games for full ground references
Regular language representations in the constructive type theory of Coq
Weak call-by-value lambda calculus as a model of computation in Coq
On the existence of a cherry-picking sequence
On the boundary between decidability and undecidability of asynchronous session subtyping
A framework to visualize equivalences between computational models of regular languages.
Motif statistics.
Automata, Boolean matrices, and ultimate periodicity.
An approach to deciding the observational equivalence of Algol-like languages
Process calculi as a tool for studying coordination, contracts and session types
Verifying polymer reaction networks using bisimulation
Automata on finite trees
Regularity conditions for iterated shuffle on commutative regular languages
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
Operational complexity and pumping lemmas
Automata methods in transcendence
Cyclotomic properties of polynomials associated with automatic sequences
Commutative rational term rewriting
Automata and finite model theory
Two collapsing hierarchies of subregularly tree controlled languages
Inference of bounded L systems with polymorphic P systems
Robust biomolecular finite automata
A game-semantic model of computation
Call-by-value lambda calculus as a model of computation in Coq
Deciding Kleene algebra terms equivalence in Coq
A formalisation of the Myhill-Nerode theorem based on regular expressions
The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
Undecidability of asynchronous session subtyping
The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp
A theory of computation based on quantum logic. I
On the formalization of some results of context-free language theory
Closures in Binary Partial Algebras
Automatentheorie und Logik
scientific article; zbMATH DE number 5872401 (Why is no real title available?)
A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
A formalisation of finite automata using hereditarily finite sets
Automatic Proof Generation in Kleene Algebra
Efficient construction of semilinear representations of languages accepted by unary NFA
Antimirov and Mosses’s Rewrite System Revisited
A Kleene Theorem for Polynomial Coalgebras
Towards a unified view of finite automata and semi-Markov flowgraph models
scientific article; zbMATH DE number 3902039 (Why is no real title available?)
scientific article; zbMATH DE number 4026835 (Why is no real title available?)
scientific article; zbMATH DE number 4049055 (Why is no real title available?)
scientific article; zbMATH DE number 4071019 (Why is no real title available?)
Reducing behavioural to structural properties of programs with procedures
Deciding unique decodability of bigram counts via finite automata
scientific article; zbMATH DE number 8122 (Why is no real title available?)
scientific article; zbMATH DE number 53545 (Why is no real title available?)
scientific article; zbMATH DE number 107969 (Why is no real title available?)
scientific article; zbMATH DE number 130894 (Why is no real title available?)
Bisimulations for fuzzy automata
scientific article; zbMATH DE number 1333447 (Why is no real title available?)
Computability by finite automata and pisot bases
scientific article; zbMATH DE number 1517989 (Why is no real title available?)
Automata and computability. A programmer's perspective
scientific article; zbMATH DE number 3999299 (Why is no real title available?)
Regular separability of well-structured transition systems
Halos and undecidability of tensor stable positive maps
Undecidability of the Spectral Gap
Brzozowski goes concurrent -- a Kleene theorem for pomset languages
Some undecidable properties of SOS specifications
Agent-based modeling, mathematical formalism for
Operational accepting state complexity: the unary and finite case
Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
Mitigating covert channels based on analysis of the potential for communication
Covering and separation for logical fragments with modular predicates
scientific article; zbMATH DE number 5279417 (Why is no real title available?)
Languages, Decidability, and Complexity
A Finite Axiomatisation of Finite-State Automata Using String Diagrams
Deconfined Global Types for Asynchronous Sessions
A Myhill-Nerode theorem for register automata and symbolic trace languages
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus
On the existential arithmetics with addition and bitwise minimum
The existential fragment of second-order propositional intuitionistic logic is undecidable
On Jaffe's pumping lemma, revisited
Subsequential transducers: a coalgebraic perspective
Binary and circular automata having maximal state complexity for the set of synchronizing words
The pumping lemma for regular languages is hard
On Minimal Pumping Constants for Regular Languages
Trace Abstraction-Based Verification for Uninterpreted Programs
Weighted edit distance computation: strings, trees, and Dyck
A vertex operator reformulation of the Kanade-Russell conjecture modulo 9
Combinatorial variations on Cantor's diagonal
Ramsey quantifiers over automatic structures: complexity and applications to verification
A type theory for strictly unital -categories
On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract)
On Jaffe's pumping lemma, revisited
The pumping lemma for regular languages is hard
Edit distance of finite state transducers
Computation of the greatest simulations and bisimulations between fuzzy automata
Detectability of discrete event systems under sensor attacks
The categorical contours of the Chomsky-Schützenberger representation theorem
Commutative semigroups with a context-free word problem
Regular languages in the sliding window model
An improved algorithm for the k-Dyck edit distance problem
The pumping lemma for context-free languages is undecidable
Algorithmic complexity of theories with Kleene iteration

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 Q4344149)