All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

1 388 (0,153s) •

Result

A new algorithm for the determinisation of visibly pushdown automata

Visibly pushdown automata are pushdown automata whose pushdown operations visibly pushdown automata can be determinised. In this paper a new algorithm for the determinisation of nondeterm...

IN - Informatika

  • 2015
    • •
  • D
    • •
  • Link
Result

Oracle Pushdown Automata

Oracle pushdown automata and lookahead pushdown automata presented here are generalizations of pushdown automata describing top-down parsing more precisely than existing models. They can be used f...

AI - Jazykověda

  • 2005
    • •
  • D
Result

Deep Pushdown Automata

Deep pushdown automata are introduced and discussed.

BD - Teorie informace

  • 2006
    • •
  • Jx
Result

Absolutely Unlimited Deep Pushdown Automata

This paper introduces an absolutely unlimited deep pushdown automata and studies their computational power. These automata are generalized versions of recently introduced deep pushdown automata in the term...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2015
    • •
  • D
    • •
  • Link
Result

Deep Pushdown Transducers and Parallel Deep Pushdown Transducers

This paper presents two variants of deep pushdown transducers as extended versions of pushdown transducers. The first - deep pushdown transducers are based on deep pushdown automata. These transducers can ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2013
    • •
  • D
    • •
  • Link
Result

An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets

and the current pushdown-store top. In this paper, we consider stateless pushdown automata pushdown automata with limited pushdown alphabets. In addition, we prove analogous results for stateless...

IN - Informatika

  • 2012
    • •
  • D
    • •
  • Link
Result

Ordered Pure Multi-Pushdown Automata

In the presented paper we discuss pure versions of pushdown automata that have no extra non-input symbols. More specifically, we study pure multi-pushdown automata, which have several pushdown lists. We re...

IN - Informatika

  • 2015
    • •
  • Jx
    • •
  • Link
Result

Regulated Pushdown Automata

The paper suggests a new investigation area of the formal language theory - regulated automata. Specifically, it investigates pushdown automata that regulate no effect on thepower of pushdown automata if t...

BD - Teorie informace

  • 2000
    • •
  • Jx
Result

A note on limited pushdown alphabets in stateless deterministic pushdown automata

Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols these results to m-state realtime deterministic pushdown

BA - Obecná matematika

  • 2013
    • •
  • Jx
    • •
  • Link
Result

Reducing Deep Pushdown Automata and Infinite Hierarchy

This contribution presents reducing variant of the deep pushdown automata.
Deep pushdown automata is a new generalization of the classical pushdown automata grammars in the classical pushdo...

JC - Počítačový hardware a software

  • 2006
    • •
  • D
  • 1 - 10 out of 1 388