DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Counter automaton
Counter automaton
Synchronizing Deterministic Push-Down Automata Can
How to Go Beyond Turing with P Automata: Time Travels, Regular Observer Ω-Languages, and Partial Adult Halting
Constraints for Membership in Formal Languages Under Systematic Search and Stochastic Local Search
Computing Downward Closures for Stacked Counter Automata
Regulated Rewriting in Formal Language Theory
Highly Undecidable Problems for Infinite Computations Olivier Finkel
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words Olivier Finkel
Rule-Restricted Automaton-Grammar Transducers: Power and Linguistic Applications
Complexity of Regular Abstractions of One-Counter Languages
Cone Types and Geodesic Languages for Lamplighter Groups and Thompson’S Group F
Model Checking Infinite-State Systems
Approximating the Shuffle of Context-Free Languages to Find Bugs in Concurrent Recursive Programs
Exercises Homework 1 301
Lecture Notes on Automata, Languages, and Grammars
Unary Languages Recognized by Two-Way One-Counter Automata
Look-Ahead on Pushdowns
[Math.GR] 9 Aug 2005 U Agaeo Any of Language H Ru,Or Group, the for Problem Word the If Only and That If Follows Indexed It Are Moreover Context-Sensitive
Automata, Languages, and Grammars
Top View
Notes on Counting with Finite Machines