Programming a universal push-down automaton
ACM-SE 37 Proceedings of the 37th annual Southeast regional conference (CD-ROM)
A framework to visualize equivalences between computational models of regular languages
Information Processing Letters
Theoretical Computer Science
Testing membership in parenthesis languages
Random Structures & Algorithms
Lambek Calculus Proofs and Tree Automata
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Bit Parallelism - NFA Simulation
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Automata: From Uncertainty to Quantum
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs
ISC '01 Proceedings of the 4th International Conference on Information Security
Regexpcount, a symbolic package for counting problems on regular expressions and words
Fundamenta Informaticae - Special issue on computing patterns in strings
Fast Approximate Search in Large Dictionaries
Computational Linguistics
A theory of computation based on quantum logic (I)
Theoretical Computer Science
Does Light Direct Life Toward Cosmic Awareness?
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
A framework for decentralized access control
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Automata Recognizing No Words: A Statistical Approach
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Can abstract state machines be useful in language theory?
Theoretical Computer Science
Theoretical Computer Science
Efficient dictionary-based text rewriting using subsequential transducers†
Natural Language Engineering
Comprehensive path-sensitive data-flow analysis
Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization
Semantic query optimization for processing XML streams with minimized memory footprint
DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
Antimirov and Mosses's Rewrite System Revisited
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Decidability of Model-Checking Information Flow Properties
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Fault detection and isolation based on fuzzy automata
Information Sciences: an International Journal
A Kleene Theorem for Polynomial Coalgebras
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Two collapsing hierarchies of subregularly tree controlled languages
Theoretical Computer Science
Unary finite automata vs. arithmetic progressions
Information Processing Letters
Inhabitation of Low-Rank Intersection Types
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Computational linguistics and generative linguistics: the triumph of hope over experience
ILCL '09 Proceedings of the EACL 2009 Workshop on the Interaction between Linguistics and Computational Linguistics: Virtuous, Vicious or Vacuous?
Closures in Binary Partial Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Dynamic programming: NFA simulation
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Automatic proof generation in Kleene algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Component models for semantic web languages
Semantic techniques for the web
Ambiguous content and disambiguation of XML schemata
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Subsequential transducers: a coalgebraic perspective
Information and Computation
On the average number of states of partial derivative automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Efficient construction of semilinear representations of languages accepted by unary NFA
RP'10 Proceedings of the 4th international conference on Reachability problems
Unambiguity in timed regular languages: automata and logics
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Finite models for formal security proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Construction of minimal deterministic finite automata from biological motifs
Theoretical Computer Science
Model-checking trace-based information flow properties
Journal of Computer Security
Parsing CFGs and PCFGs with a Chomsky-Schützenberger representation
LTC'09 Proceedings of the 4th conference on Human language technology: challenges for computer science and linguistics
Complex event pattern detection over streams with interval-based temporal semantics
Proceedings of the 5th ACM international conference on Distributed event-based system
Turing machines on cayley graphs
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
The average transition complexity of Glushkov and partial derivative automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Combinatorial variations on Cantor's diagonal
Journal of Combinatorial Theory Series A
Constraint-aware complex event pattern detection over streams
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Models of computation for reactive control of autonomous mobile robots
Expert Systems with Applications: An International Journal
On two dually nondeterministic refinement algebras
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Linear systems for regular hedge languages
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Interval probabilities of state transitions in probabilistic automata
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Brzozowski's algorithm (co)algebraically
Logic and Program Semantics
Parallel quantum algorithm for finding the consistency of saaty's matrices
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Algorithmic games for full ground references
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Rough Approximations in Varieties of Regular Languages
Fundamenta Informaticae
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Weakly-Synchronized ground tree rewriting
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Automata Recognizing No Words: A Statistical Approach
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Does Light Direct Life Toward Cosmic Awareness?
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Regexpcount, a symbolic package for counting problems on regular expressions and words
Fundamenta Informaticae - Computing Patterns in Strings
The duality of state and observation in probabilistic transition systems
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Reducing behavioural to structural properties of programs with procedures
Theoretical Computer Science
Deciding unique decodability of bigram counts via finite automata
Journal of Computer and System Sciences
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions
Journal of Automated Reasoning
| Hi-index | 0.01 |
From the Publisher:This introduction to the basic theoretical models of computability develops their rich and varied structure. The first part is devoted to finite automata and their properties. Afterwards, pushdown automata are utilized as a broader class of models, enabling the analysis of context-free languages. In the remaining chapters, Turing machines are introduced, and the book culminates in discussions of effective computability, decidability, and Godel's incompleteness theorems.