scientific article; zbMATH DE number 1927559
From MaRDI portal
Publication:4484483
zbMATH Open1012.68121MaRDI QIDQ4484483FDOQ4484483
Authors: Kousha Etessami 
Publication date: 12 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210131.htm
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 8122
- Deterministic automata. Simulation, universality and minimality
- A linear-time simulation of deterministic \(d\)-limited automata
- DNA Computing
- On the computational complexity of P automata
- scientific article
- scientific article; zbMATH DE number 1839454
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
- Simulation algorithms for symbolic automata
Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (26)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enhancing Simulation for Checking Language Containment
- Title not available (Why is that?)
- Complementing Büchi Automata with Ranker
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient State Space Reduction for Automata by Fair Simulation
- Advanced Ramsey-based Büchi automata inclusion testing
- Büchi automata can have smaller quotients
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Multipebble simulations for alternating automata (extended abstract)
- Multi-buffer simulations: decidability and complexity
- Title not available (Why is that?)
- Multi-buffer simulations for trace language inclusion
- Matching in security-by-contract for mobile code
- A general architecture of oritatami systems for simulating arbitrary finite automata
- Capacitated automata and systems
- Game-theoretic simulation checking tool
- Topological characterisation of multi-buffer simulation
- Computing the width of non-deterministic automata
- Width of non-deterministic automata
- Simulation relations and applications in formal methods
- Simulations in rank-based Büchi automata complementation
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- A comparison of succinctly represented finite-state systems
Uses Software
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 Q4484483)
